leetle

Daily challenge for 2025-10-02

275. Third Maximum Number

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.

Example:
Input: nums = [3,2,1]
Output: 1

Run this challenge interactively in Python or JavaScript when the app loads.