Software Development Engineering Intern Interview Questions and Answers

Find minimum arrows needed to burst balloons in decreasing order of height

• Sort the array in decreasing order of height

• Initialize arrow count to 1 and max height to first balloon height

• Iterate through the array and if current balloon height is greater than max height, increment arrow count and update max height

• Return arrow count

• Time complexity: O(nlogn) for sorting, O(n) for iteration

• Space complexity: O(1)

The maximum length of the alternating sequence is returned along with the sequence itself.

• Iterate through the array and check if each element alternates with the previous one.

• Keep track of the current alternating sequence length and the maximum length seen so far.

• If the current element breaks the alternating pattern, update the maximum length and reset the current length.

• Print the alternating sequence by storing the elements in a separate array.

The answer is a letter in the string that appears most frequently.

• Iterate through each letter in the string and count its frequency

• Keep track of the letter with the highest frequency

• Return the letter with the highest frequency

Given a binary matrix, find the largest square containing only 1's and return its area.

• Use dynamic programming to solve the problem

• Create a 2D array to store the maximum size of square at each point

• For each point, check the top, left, and diagonal top-left values to calculate the maximum size of square

• Return the maximum size of square found