Find Second Largest Element

Problem

Given an array of integers nums, return the second-largest distinct element in the array. If a second-largest distinct value does not exist, return None. The function should run efficiently without sorting the entire array.

Constraints

• 1 <= len(nums) <= 10^5
• -10^9 <= nums[i] <= 10^9
• Return the second-largest distinct value, not the second occurrence of the maximum