Software Engineer, new Grad Interview Questions and Answers

Determining the state of switches/junctions after N trains have passed through them.

• Create an array to represent the state of each switch/junction

• Iterate through each train and update the state of the corresponding switch/junction

• Use a loop to simulate the passing of trains and updating of switches/junctions

• Return the final state of the switches/junctions

Level order traversal of a binary search tree (BST) is a breadth-first search algorithm that visits each level of the tree from left to right.

• Use a queue to keep track of the nodes to be visited

• Start with the root node and enqueue it

• While the queue is not empty, dequeue a node and visit it

• Enqueue the left and right child of the visited node if they exist

• Repeat until all nodes have been visited

Move all zeros to the end of the array while maintaining the relative order of the non-zero elements.

• Iterate through the array and keep track of the index to place the next non-zero element.

• When encountering a non-zero element, swap it with the element at the current index.

• After iterating through the array, all zeros will be moved to the end while maintaining the order of non-zero elements.

Merge subsets of strings with a twist

• Merge subsets of strings into a single array

• The twist is that each subset should be reversed before merging

• Return the merged array of reversed subsets