Easy
Third Distinct Maximum
Easy
254 submissions
10 coins
+50 XP
Array
Sorting
Problem Description
Return the third largest **distinct** value in `nums`. If fewer than three distinct values exist, return the largest value.
**Example 1:**
```
Input: nums = [3, 2, 1]
Output: 1
```
**Example 2:**
```
Input: nums = [1, 2]
Output: 2
```
**Example 3:**
```
Input: nums = [2, 2, 3, 1]
Output: 1
```
Constraints
- `1 <= nums.length <= 10^4`
- `-2^31 <= nums[i] <= 2^31 - 1`
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share