leetCode2 min read
414. Third Maximum Number | LeetCode Solution | JavaScript | Easy
Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number.
P
Pranay Kothapalli
July 26, 2024
#leetCode_arrays#leetCode_easy
PK
Pranay Kothapalli
Senior Frontend Developer specializing in UI components and design systems. With over 12 years of experience, I contribute to open-source projects and write about React, TypeScript, and modern web development.
Maintainer at Rad UIFullstack Engineer at Sprinto
Enjoyed this article?
Explore more interactive algorithm visualizations and computer science concepts to continue your learning journey.