Paytm Interview Experience (On-Campus)
Online Assessment
- Time: 60 min
- Total number of questions: 8
- Coding Questions: 2
- Coding Question 1: (slight modification of below question)
https://www.w3wiki.net/lexicographically-smallest-string-formed-by-removing-duplicates/ - Coding Question 2: The question gives an array as an input and we need to find the maximum number of transactions possible. Given the positive numbers and negative numbers you need to make transactions that do not lead to a negative sum, you have the choice of skipping the transaction.
- Coding Question 1: (slight modification of below question)
- SQL Query: 1
- SQL Query: Uses the concepts of left join.
- Multiple Options Correct MCQ: 5
Round 1 (Virtual Technical Interview) Time: 45 min
- 1. Introduce yourself
- 2. 10 min discussion on projects
- 3. Reverse Linked List (Iteratively and Recursively)
- 4. DNF Algorithm
*In both cases, I only need to write the function of the required question on any IDE, no need to write the driver function.
Round 2 (Virtual Technical Interview) Time: 45 min
- Introduce yourself
- Work experience and learnings from the internship
- An in-depth discussion on projects was asked how core subjects like OS, DBMS, and OOPs were used in your projects.
- How do web crawlers work?
- Difference between sorting algorithms: merge, quick, bubble, insertion, selection, and heap sort, on the basis of how they work, their stability, and worst and best case time/space complexities.
- I was told to code Merge Sort along with the driver function
Round 3 (Telephonic HR Round: This was also an elimination round.) Time: 10 min
- Introduce yourself
- Why Paytm?
- Why should we hire you?
- What is the tech stack of Paytm?
- Profile: Frontend or Backend
- Job Location
Verdict: Selected !!!
Key Points:
- I explained each and every line of my code along with time and space complexity.
- I always give a naive approach first and then optimized it to an efficient approach.
- Core subjects, OOPs, and Projects play a critical role in cracking any interview.
Contact Us