Paytm Hiring Drive for Backend Engineer. The selection process was completed on the same day.
- Round 1 ( Written ):
It was a technical written round with 20 questions out of which 2 were coding questions.
Rest 18 was objective type mainly C, SQL, Algo.- Write code to create mirror image of tree.
- Given an array of arrival and departure time of guests, find minimum no fo rooms required to accommodate guests at any point of time.
- Round 2 :
- WAP to search a number in a row-wise – column wise sorted matrix.
- Flatten a linked list.
- Discussions around binary and ternary search.
- Discussed objective questions of a written round.
Round 3 :- How will you store a series of mobile nos in memory efficiently (less space).
e.g mobile nos like 999900001,999900003,999900005,999910006,999910007 … are there.
DS should be designed such that retrieval is not inefficient. - Stream of Access logs is given to you with user id, page id and date.
Design Data structure to find n recent unique visitors and page they visited. - Current company projects discussions.
- How will you store a series of mobile nos in memory efficiently (less space).
I thank GFG a lot for helping me in my preparation, finally, I was selected 🙂
If you like neveropen and would like to contribute, you can also write an article and mail your article to review-team@neveropen.co.za. See your article appearing on the neveropen main page and help other Geeks.
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!