1. Coding Round 1

a. Print a matrix in spiral order (Code) Soln: Solved it using recursion. Each recursive call was supposed to print boundary elements. On every recursive call, shifted the origin point and passed the new size of the matrix.

b. Given a pair of braces {}. Validate it. (Code) Soln: Using two variables (i.e., open_count and close_count) and proceeded further.

c. What if there are multiple types of braces? (Approach) Soln: Using a stack.

1. Telephonic Round 2

a. Given a list of songs. How would you shuffle it? (Code) Soln: Provided various approaches from naive to optimal. The optimal one was similar to shuffling an array of integers.

b. Given a list of words. Print all anagrams together. (Code) Soln: Used a HashMap with the key as sort(str[i]) and the value as a List which stores anagrams.

1. In-house Round 1

There are various varieties of clothes (e.g., shirts). Varieties are based on parameters like pattern, size, color, etc.

a. What would be your input format to store all values of all parameters? Soln: A List of Lists. Each inner List denotes values for a particular parameter.

b. Design a class for a shirt for the same requirement.

c. You have to return all different types of shirts that can be formed based on various combinations of input parameters. (Code)

d. Assuming you have all types of shirts available. Now there are various queries, for example: i. Show all types of shirts having color "red". ii. Show all types of shirts having size "small" and pattern "check", etc.

b. Given two arrays of ints of size m and m+n, both in sorted order. Merge them in-place. Famous problem. (Code)