You are given an integer array ranks, where ranks[i] represents the rank of the student at index i. A smaller value indicates a better rank.

Initially, the student at index $0$ is selected. Moving through the remaining students from left to right starting from index $1$, a student replaces the currently selected student if their rank is strictly better than the rank of the currently selected student.

Return the total number of student replacements that occur.

Constraints:

• $1 \leq$ ranks.length $\leq 10^5$

• $1 \leq$ ranks[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.