Green View Public School Interview Questions and Answers

To find max window of matching patterns between two sequences of length N with mutated patterns.

• Create a sliding window of size N and traverse both sequences simultaneously.

• Check for matching patterns in the window and keep track of the maximum window with matching patterns.

• Use a hash table to keep track of mutated patterns.

• If a pattern is mutated, update the hash table and check if it matches with the other sequence.

• Repeat until the end of both sequences is reached.

• Return th...read more

Find length of longest consecutive substring of 0 and 1 with equal count in given array of bits.

• Create a prefix array to store the difference between count of 0s and 1s till each index.

• Find the first and last occurrence of each unique value in prefix array.

• Calculate the length of the subarray between first and last occurrence of each unique value.

• Return the maximum length of subarray with equal count of 0s and 1s.

Rotate a string of length n word by word with constant extra space in linear time.

• Reverse the entire string

• Reverse each word in the string

• Handle the last word separately

• Time complexity: O(n)

• Space complexity: O(1)

Find the maximum window size of common substring in two given sequences.

• Use dynamic programming to find the length of longest common substring.

• Slide a window of that length over both sequences to find the common substring.

• If no common substring is found, decrease the window size and repeat.

Generate all possible letter combinations of a phone number

• Create a mapping of digits to letters

• Use backtracking to generate all combinations

• Handle edge cases like empty input or invalid digits