Grey Orange Software Engineer Interview Questions and Answers

Generate and print all possible permutations of a given input string.

• Use recursion to generate all permutations by swapping characters in the string.

• Maintain a visited array to keep track of characters already used in a particular permutation.

• Print each permutation as it is generated.

• Handle duplicate characters by skipping swapping if the character is already in the current position.

The task is to find the length of the longest consecutive sequence in an unsorted array of integers.

• Sort the array to bring consecutive numbers together

• Iterate through the sorted array and keep track of the current consecutive sequence length

• Update the maximum length if a longer sequence is found

The program calculates the Nth Fibonacci number using a recursive formula.

• The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.

• The program uses a recursive function to calculate the Nth Fibonacci number.

• The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.

The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.

• Iterate through the string from the last character to the first character and append each character to a new string.

• Alternatively, you can use built-in string reversal functions or methods available in your programming language.

• To solve the follow-up question with O(1) space complexity, you can use a two-pointer approach. Initialize two pointers, one at the be...read more

Calculate total area covered by a list of rectangles on a plane.

• Iterate through each rectangle and calculate its area

• Check for overlapping areas between rectangles

• Sum up the total area covered by all rectangles