Sum of the First K
Return the sum of the values of the first k nodes. If the list has fewer than k nodes, add up all of them. 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 [1,2,3,4]
k 2
returns 3
1 + 2.
Example 2
head [5,5]
k 10
returns 10
Only two nodes exist.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 1000 <= k <= 200
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 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
- Compress RunsEasy