Online Coding Round: 1 hr 15 mins
- https://www.hackerearth.com/problem/algorithm/beautiful-numbers-05de0f51-101121ca/ (100 marks)
- One another question of 50 marks, solved with brute force
Technical Interview: 1 hr
- i/p => [1 , 2 , 3, 3, 3, 3]. Find first and last occurrence of all array elements. told HashMap approach. Then interviewer modified problem to: https://www.geeksforgeeks.org/find-first-and-last-positions-of-an-element-in-a-sorted-array/amp/
- https://www.geeksforgeeks.org/find-itinerary-from-a-given-list-of-tickets/amp/
Got rejection mail immediately after this round