Round 1 1st q: - problem on string detection in another string. 2nd q:- problem related to matrix 3rd q:- n people standing in circle. A revolver is given to 1st person. He kills the 2nd and passes revolver to 3rd . 3rd kills 4th and passes to next and so on. Given n , find last man standing. 4th q:- based on dfs of tree (recursion). Round 2 Optimization of earlier written codes New problem.:- Accept a 1d array as input from user and display it in upper triangular matrix. And mirror the same in lower triangle of matrix too. After that asked me to optimize it to complexity O(n).
