Kth Smallest Value
Return the k-th smallest value in the list, where k = 1 is the smallest. Duplicates count separately, so in [2, 2, 3] the 2nd smallest is 2. 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,1,4,2]
k 2
returns 2
Sorted: 1, 2, 4, 5. The 2nd is 2.
Example 2
head [2,2,3]
k 2
returns 2
Duplicates count separately.
Constraints
1 <= k <= 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
- Largest Adjacent Pair SumBeginner
- Largest ValueBeginner
- Last Node's ValueBeginner
- Linked List to TextBeginner
- Longest Run of Equal ValuesBeginner
- One Bubble PassBeginner
- Running Totals ListBeginner
- Second Largest ValueBeginner