Good and well Check whether array contains duplicates or not Roman to integer conversion Check the string whether it contains repeated substring or not. ex: abab ---> return true abc ------> return false Check sum problem. Minimum number of steps needed to reach the bottom right of the n*n matrix from top right corner of the matrix. Soon after the completion of this round they shortlist the candidates (Immediate filtering no waiting time) Note:: You can use any editor of your choice. Advanced coding round (Round 3) They provide one question and give around 1 hr. Once you solve this question you are asked to make some major changes to the existing problems your asked to leave there it self.I am rejected in this round I took more time to solve first itlself Question: Matrix based question Description: Insert a ball or stone at a particular column of a matrix if that cell is already filled insert in above cell. If that entire column is filled print that column is filled. 1 based indexing