Round 1: Online Round on Hacker Earth. Two questions were given –
- Given a string consisting only of A and B. Find the maximum length substring which is repeated exactly twice and is non overlapping.
- Given a positive Integer, find no of ways in which consecutive natural no.s can be added to get this no. Example – N = 15. Ans – 3 ( (1,2,3,4), (4,5,6), (7,8))
Round 2: This was the problem solving round. Three questions were asked in this round –
- Given an array which represents price of a share on different days, you can either purchase one share on a day or sell all the shares which you had previously bought. Find the maximum profit. Was asked to write code for this.
- Given an 2D matrix and two different points (i1,j1) , (i2,j2). Find the sum of all elements which are there in the rectangle made by these points. You can safely assume that these points always make a rectangle. Was asked to write code for this.
- Design a data structure which supports below operations in O(1) time –
- getRandomElement ( This is not required to be random, you can always return any or same element from the existing elements).
Round 3: This round was for testing java skills and code writing ability. Was asked to write codes for the following –
- Find if there is a loop in a linked list. Also its starting point.
- Find pivot in a rotated and sorted array.
Round 4: Hiring manager round. Was asked to design bitly kind of url shortening application. Other questions were related to my previous work experience.
Thank you GeeksforGeeks for helping me during my interview preparation. 🙂