Tap here to switch tabs
Problem
Submissions

Problem: Third Maximum Number

easy
15 min
Explore how to determine the third distinct maximum element in an integer array or return the maximum if fewer than three distinct elements exist. Understand the problem constraints and implement a solution using the top K elements pattern to improve your coding interview skills.

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:

  • 1<=1 <= nums.length <=103<= 10^3

  • 231<=-2^{31} <=nums[i]<=2311<= 2^{31}-1

Unlock AI-Powered LearningUpgrade to smarter learning with instant explanations of Ask Agent, Personalized Interview Prep, Real-World Projects, 3 AI Mock Interviews per month, and Personalized Paths
Tap here to switch tabs
Problem
Submissions

Problem: Third Maximum Number

easy
15 min
Explore how to determine the third distinct maximum element in an integer array or return the maximum if fewer than three distinct elements exist. Understand the problem constraints and implement a solution using the top K elements pattern to improve your coding interview skills.

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:

  • 1<=1 <= nums.length <=103<= 10^3

  • 231<=-2^{31} <=nums[i]<=2311<= 2^{31}-1

Unlock AI-Powered LearningUpgrade to smarter learning with instant explanations of Ask Agent, Personalized Interview Prep, Real-World Projects, 3 AI Mock Interviews per month, and Personalized Paths