Midas Safety Interview Questions and Answers

Sort an array of 0s and 1s

• Use two pointers, one at the beginning and one at the end

• Swap 0s from the beginning with 1s from the end until pointers meet

• Time complexity: O(n)

Level order traversal is a tree traversal algorithm that visits nodes level by level.

• Start at the root node and add it to a queue.

• While the queue is not empty, remove the first node from the queue and add its children to the queue.

• Repeat until the queue is empty.

• The order in which nodes are visited is the level order traversal.