Skip to content

Practice The Number of Weak Characters in the Game

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1996
LeetCode Problem

The Number of Weak Characters in the Game

Problem Statement

You are playing a game that contains multiple characters, and each of the characters has two main properties: attack and defense. You are given a 2D integer array properties where properties[i] = [attacki, defensei] represents the properties of the ith character in the game. A character is said to be weak if any other character has both attack and defense levels strictly greater than this character's attack and defense levels. More formally, a character i is said to be weak if there exists another character j where attackj > attacki and defensej > defensei. Return the number of weak characters.

Source: The Number of Weak Characters in the Game on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
properties = [[5,5],[6,3],[3,6]]
Output
0

# Example 2

Input
properties = [[2,2],[3,3]]
Output
1

# Example 3

Input
properties = [[1,5],[10,4],[4,3]]
Output
1

Constraints

2 <= properties.length <= 10^5
properties[i].length == 2
1 <= attacki, defensei <= 10^5

Related LeetCode Problems

Practice more problems similar to The Number of Weak Characters in the Game.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.