Round 1: Online Coding Interview(easy)
Duration: 90 minutes
Number of questions: 1
Problem: Anagram Pairs
Statement: Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as “spar” can be formed by rearranging letters of “rasp”. Hence, “spar” and “rasp” are anagrams.
Link: https://www.geeksforgeeks.org/problems/anagram-1587115620/1
Round 2: Face-to-Face (Medium)
Duration: 90 minutes
Number of questions: 2
This was a live coding round
Problem 1: Next Greater integer
Statement: You are given a string S which represents a number. You have to find the smallest number strictly greater than the given number which contains the same set of digits as of the original number i.e. the frequency of each digit from 0 to 9 should be exactly the same as in the original number.
Link: https://www.geeksforgeeks.org/problems/next-permutation5226/1?utm_source=gfg&utm_medium=article&utm_campaign=bottom_sticky_on_article
Problem 2: Ninja’s Robot
I don’t remember the exact question but the question in the given link is similar
Link: https://www.geeksforgeeks.org/problems/d35adfbe367861ec1e67bea6e0efebe0a0ee3550/0?page=1&sortBy=newest&query=page1sortBynewest