A school is trying to take an annual photo of all the students. The students are asked to stand in a single file line in non-decreasing order by height. Let this ordering be represented by the integer array expected where expected[i] is the expected height of the ith student in line.

You are given an integer array heights representing the current order that the students are standing in. Each heights[i] is the height of the ith student in line (0-indexed).

Return the number of indices where heights[i] != expected[i].

&nbsp;
Example 1:

Input: heights = [1,1,4,2,1,3]
Output: 3
Explanation: 
heights:  [1,1,4,2,1,3]
expected: [1,1,1,2,3,4]
Indices 2, 4, and 5 do not match.


Example 2:

Input: heights = [5,1,2,3,4]
Output: 5
Explanation:
heights:  [5,1,2,3,4]
expected: [1,2,3,4,5]
All indices do not match.


Example 3:

Input: heights = [1,2,3,4,5]
Output: 0
Explanation:
heights:  [1,2,3,4,5]
expected: [1,2,3,4,5]
All indices match.


&nbsp;
Constraints:


	1 &lt;= heights.length &lt;= 100
	1 &lt;= heights[i] &lt;= 100


class Solution:
    def heightChecker(self, heights: List[int]) -> int:
        heightssort = sorted(heights)
        import numpy as np
        diff = list(np.array(heightssort) - np.array(heights))
        return (len(diff) - diff.count(0))
class Solution {
    public int heightChecker(int[] heights) {

      int[] dupheights = Arrays.copyOfRange(heights , 0 ,heights.length);

      Arrays.sort(dupheights);
      int count = 0;

      for(int i=0 ; i< heights.length ; i++){

        if(heights[i] != dupheights[i]){
          count++;
        }

      }

      return count;

    }
}
class Solution {
public:
    int heightChecker(vector<int>& heights) {
        vector<int> expected=heights;
        int count=0;
        sort(expected.begin(),expected.end());
        for(int i=0;i<heights.size();i++){
            if(heights[i]!=expected[i])
            count++;
        }
        return count;
    }
};
var heightChecker = function(heights) {
  let count = 0;
  const orderedHeights = [...heights].sort((a, b) => a-b)

  for (let i = 0; i < heights.length; i++) {
    heights[i] !== orderedHeights[i] ? count++ : null
  }

  return count
};
Height Checker