Practice Height Checker
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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].
Source: Height Checker on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
heights = [1,1,4,2,1,3]
3
# Example 2
heights = [5,1,2,3,4]
5
# Example 3
heights = [1,2,3,4,5]
0
Constraints
Related LeetCode Problems
Practice more problems similar to Height Checker.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.