Some question of first round-Print the factorial of a given no (no can go up to 12) Give an and k where n is n-th digit no for which you have to find the sum k. For example---n=3 k=6 so there are 21 3-digit no whose digit sum up to 6(105,..123….600) Find the non-anagrams from the given sentence. Some questions were to find the output of the program, there were one network ques to find the no of hosts from given subnet mask. One SQL query was given to find its o/p. 2nd round-Given arrival time and departure time of trains in the array. find the minimum no of stations required for the trains. Given an array of numbers. List the Pythagoras triplets from the array. e.g.---9,2,3,6,5,4,8,10 O/p--{{3,4,5},{6,8,10}} We had to do these programs in min time complexity. We had to mention the time and space complexity and write the program with comments. 3rd round- some basic questions in java, a little bit about my project. Then 2-3 coding ques like-1.) Find the intersection node of the two linked lists. 2.)Given an array of stock prices. You can sell and buy stock but first, you have to buy to sell. You have to maximize the profit. 3.)Given an array of characters, reverse the characters of the array without changing the position of the vowels. e.g.['m','n','e', 'p'] O/p---['p','n','e','m'] 4th round-1.)Modified sudoku problem---The sudoku can be 9X9 or 12X12 or 15X15. Tell whether the sudoku is valid or not. 2.)Given an array of repeating and non-repeating numbers. Rearrange it in a way such that no two repeating elements are together. Tell if it is possible or not possible. e.g. 2 2 2 1 3 4 O/p---2 1 2 3 2 4 2 2 2 1 O/p---not possible HR round---They normally asked about my hobbies and told me about HashedIn university.