Get the Kth Value
Return the value of the node at index k, where the head is index 0. If the list has no node at index k, return -1. 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 [10,20,30]
k 1
returns 20
Index 1 holds 20.
Example 2
head [10,20,30]
k 3
returns -1
Only indexes 0 to 2 exist.
Constraints
0 <= number of nodes <= 1000 <= k <= 200-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
- Is It a PrefixBeginner
- Is the List SortedBeginner
- Kth Smallest ValueBeginner
- Largest Adjacent Pair SumBeginner
- Largest ValueBeginner
- Last Node's ValueBeginner
- Linked List to TextBeginner
- Longest Run of Equal ValuesBeginner