Problem
Ask
Submissions
Problem: Third Maximum Number
Easy
15 min
Explore how to identify the third distinct maximum number in an integer array by applying the top k elements pattern with heaps. Learn to handle arrays with fewer than three distinct elements by returning the maximum, and implement your solution in a coding environment. This lesson solidifies problem-solving skills for coding interviews with practical examples.
Statement
Given an integer array, nums, determine and return the third distinct maximum element in the array. If the array contains fewer than three distinct elements, return the maximum element instead.
Constraints:
nums.lengthnums[i]
Examples
Understand the problem
Figure it out!
Try it yourself
Similar Problems
K Closest Points to Origin
Top K Frequent Elements
Kth Largest Element in an Array
Maximal Score After Applying K Operations
Find the Kth Largest Integer in the Array
Find Subsequence of Length K with the Largest Sum
Minimum Cost to Hire K Workers
Smallest Range Covering Elements from K Lists
Maximum Performance of a Team
K Maximum Sum Combinations From Two Arrays
⋮
Problem
Ask
Submissions
Problem: Third Maximum Number
Easy
15 min
Explore how to identify the third distinct maximum number in an integer array by applying the top k elements pattern with heaps. Learn to handle arrays with fewer than three distinct elements by returning the maximum, and implement your solution in a coding environment. This lesson solidifies problem-solving skills for coding interviews with practical examples.
Statement
Given an integer array, nums, determine and return the third distinct maximum element in the array. If the array contains fewer than three distinct elements, return the maximum element instead.
Constraints:
nums.lengthnums[i]
Examples
Understand the problem
Figure it out!
Try it yourself
Similar Problems
K Closest Points to Origin
Top K Frequent Elements
Kth Largest Element in an Array
Maximal Score After Applying K Operations
Find the Kth Largest Integer in the Array
Find Subsequence of Length K with the Largest Sum
Minimum Cost to Hire K Workers
Smallest Range Covering Elements from K Lists
Maximum Performance of a Team
K Maximum Sum Combinations From Two Arrays