First, there was a phone interview, then they called for an on-site interview.

Total of 4 rounds.

Each round involved one person, with mostly technical questions.

There were a few questions about network topologies, previous work, and programming.

Overall, a nice experience.

Given an array containing zeros and non-zero numbers, sort it such that all zeros go to the right side of the array, and non-zero numbers maintain their original order.

Example: 2, 0, 3, 1, 0, 4 should become 2, 3, 1, 4, 0, 0.

Conditions:

• Should not use extra space (temporary variables are acceptable).
• Should complete in O(n) time.