Second Largest Value
Return the second largest distinct value in the list. If the list has fewer than two distinct values, return None. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [5,9,9,3]
returns 5
Distinct values are 9, 5, 3, so the answer is 5.
Example 2
head [4,4]
returns null
Only one distinct value.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Sum of the First KBeginner
- Sum of the ValuesBeginner
- Swap First and Last ValuesBeginner
- Values in Reverse OrderBeginner
- Add Lists Position by PositionEasy
- Append a ValueEasy
- Best Window SumEasy
- Common Values of Two Sorted ListsEasy