Online Coding Round : Platform used was cocubes.com
Time : 75 min Question : 3 Coding Question
- Simple linked list implementation. Given two strings in the form of linked lists you were to find the lexicographical greatest string.
Solution: GeeksforGeeks Link
- You were given an array and you were supposed to find the number of elements which is/are largest among all elements present in the right side of that particular element in the array.
- It was a question related to BP+Bitmask. I don’t remember the exact question.
Around 27 students were selected from the coding round and were called for further interview rounds.
The interviewer was very friendly.He asked me to introduce my self
Then he asked me some question :
- Find the maximum cost in traversing a 2-D matrix from one given cell to another. It is same as Min Cost Path DP problem.
He asked me to write a code for this.
- Rod Cutting DP
I gave him an approach and he was satisfied with this. Then he asked me to write the code.
Solution: GeeksforGeeks Link
- Left view of Binary Tree
I gave him an approach and he was happy with approach. After this I was asked to write the code.
After these questions he went on for some theoretical questions related to OOPS, DBMS, OS etc.
He asked basic questions like polymorphism and its types. Then, about Normalization and its types with example. He also asked questions related to semaphores.
Round 2(Face To Face 2)
The interviewer was very friendly.He asked me to introduce my self and about my hobby.
- He then moved on to the theoretical concepts of subjects. He asked me questions related to DBMS(transactions and its properties-ACID, about normalization with examples, indexing), OS(paging, segmentation, difference between process and thread etc).
- After this he moved to my project, he asked me to give brief idea about my project. He asked questions related to my project(SQL vs No SQL, Node-Js concepts etc.).
- Then he asked me a simple coding question with certain constraints and I solved it. He was very happy with my solution.
- At the last he gave me a puzzle to which I couldn’t solve.
- The interviewer was very friendly. He went through my resume and asked about my interest and extra co-curricular activities.
- After this he asked about my aims, and other HR’s like questions.
- He asked few project related questions and this was all for this round.
The interviewer was very friendly. She asked me to introduce myself.
She asked about my hobby. After this few questions like Why Paytm? etc. This was non-tech round. She wanted to check your nature, attitude and team work skills. Then I was asked to wait for the results.
Verdict – Selected 🙂
A big thank you to GeeksforGeeks for providing such invaluable material for preparation.
- Paytm Interview experience for FTE (On-Campus)
- Paytm Interview Experience for FTE+6 Months Internship (On-Campus)
- Paytm Interview Experience for Software Engineer FTE (On-Campus)
- MathWorks Interview Experience (EDG, Oncampus)
- ServiceNow Interview Experience Oncampus
- UHG Interview Experience | OnCampus- 2019
- InfoEdge Interview Experience | OnCampus-2019
- Paytm Interview Experience | Set 21 (5+ Experience)
- Paytm Java Interview Experience( 2-4 year Experience during COVID19 )
- Paytm Interview Experience for SDE-1 | 2 Year of Experience
- One97(Paytm) Interview Experience
- Paytm Interview Experience | Set 4 (Walk-in Drive)
- Paytm Interview Experience | Set 5 (Recruitment Drive)
- Paytm Interview Experience | Set 6 (Recruitment Drive)
- Paytm Interview Experience | Set 7 (Written Test Hyderabad)
- Paytm Interview Experience | Set 8 (Hiring Drive for Backend Engineer)
- Paytm Interview Experience | Set 9
- Paytm Interview Experience | Set 10 (For Experienced)
- Paytm Interview Experience | Set 11 (For 2 Years Experienced)
- Paytm Interview Experience | Set 12 (For 1.5 Years Experienced)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.