Phase 1 - Test 1 - 1.) convert Roman numbers to integers (upto 35) 2.) pattern of hollow box of stars of size n Test 2 - 1.) given 2 arrays and a target , return indices of array 1 and 2 whose sum equals to target. 2.) given substring of a string exists or not, if yes then at what starting index , without using and predefined functions. 3.) find cousins or a node in tree. 4.) Input an array of special symbols and sort them in the given array sequence ! % $ # & @ ^ . 5.) Pattern A B C D A B C A B A A B A B C A B C D for n 6.) Transpose of matrix. 7.) Find all inversion in a given array. Phase 2 - PI questions - 1.) Text Justification (leetcode 68) 2.) from an array of integers , return the indices of 2 elements whose sum is closest to target. 3.) Trapping Rain Water (leetcode 42) 4.) Merge Intervals (leetcode 56)
