I met a recruiter at the Swift Summit in San Francisco.

Following that, I had a 45-minute phone call with the recruiter.

This was then followed by a 45-minute technical phone screen, during which I coded on a screen-sharing IDE.

Unfortunately, I did not move on to an on-site interview.

Return the head node of a singly linked list with each pair of nodes swapped. If there is a last odd node, leave it in place.

Example: Input: 1 -> 2 -> 3 -> 4 -> 5 Output: 2 -> 1 -> 4 -> 3 -> 5

Take in an integer array and move all the zeros to the end in place. It doesn't matter how the non-zero numbers are ordered. Preferably as efficient and as space-efficient as possible.

Example: Input : [ 3, 0, 2, 0, 0, 4, 1, 0 ] Accepted Output: [ 4, 2, 3, 1, 0, 0, 0, 0 ]