Bounteous x Accolite Senior Software Developer Interview Questions, Process, and Tips

Find maximum for each contiguous subarray of size k from an array of size n.

• Iterate through the array and keep track of maximum for each subarray of size k

• Use a sliding window approach to efficiently calculate maximum for each subarray

• Time complexity: O(n)

• Example: arr = [10, 5, 2, 7, 1, 9, 4], k = 3, output = [10, 7, 7, 9, 9]

Permutations of a string

• Use recursion to swap characters and generate permutations

• Iterate through the string and swap each character with the first character

• Repeat the above step for each character in the string

Left view of a binary tree

• The left view of a binary tree shows the leftmost node at each level

• We can traverse the tree in a pre-order fashion and keep track of the current level

• If the current level is greater than the maximum level seen so far, add the node to the result

Segregate an array of 0s and 1s with minimum swaps.

• Count the number of 0s in the array.

• Swap the 1s with the 0s until all 0s are on one side and 1s on the other.

• The minimum number of swaps required is half the number of 1s on the side with fewer 1s.