You are playing a game with multiple characters. You are given a $2 ext{D}$ integer array properties where properties[i] $= [ ext{attack}_i, ext{defense}_i]$ represents the attack and defense values of the $i ext{th}$ character.

A character is considered weak if there exists another character that has both strictly greater attack and strictly greater defense.

Return the total number of weak characters.

Constraints:

• $2 \leq$ properties.length $\leq 10^5$

• properties[i].length $= 2$

• $1 \leq ext{attack}_i, ext{defense}_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.