Move a Value to the End
Move every node whose value equals target to the end of the list. All other nodes keep their relative order, and so do the moved ones. Return the head. 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,0,2,0,3]
target 0
returns [1,2,3,0,0]
Both 0s move to the back.
Example 2
head [4,5]
target 9
returns [4,5]
Nothing matches.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100-100 <= target <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Odd Even Linked ListMedium
- Partition ListMedium
- Plus One Linked ListMedium
- Remove All Duplicated ValuesMedium
- Remove Nodes With a Larger Node AfterMedium
- Remove Nth Node From End of ListMedium
- Reorder ListMedium
- Reverse Between PositionsMedium