Evens Before Odds
Rearrange the list so every node with an even value comes before every node with an odd value. Inside each group keep the original order. Return the head. Remember that 0 is even and negative numbers can be odd too, like -3. 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,5,6]
returns [2,4,6,1,3,5]
Evens 2, 4, 6 then odds 1, 3, 5.
Example 2
head [-3,0,-2]
returns [0,-2,-3]
0 and -2 are even.
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
- Last One StandingMedium
- Length of the CycleMedium
- Maximum Twin SumMedium
- Move a Value to the EndMedium
- Odd Even Linked ListMedium
- Partition ListMedium
- Plus One Linked ListMedium
- Remove All Duplicated ValuesMedium