i
Paytm
Filter interviews by
Search for a target value in a sorted matrix efficiently.
Start from the top right corner and move left or down based on comparison with target value
Utilize the sorted nature of the matrix to eliminate certain rows or columns
Implement binary search for more efficient search in each row or column
1st round was online test with 3 easy-medium leetcode questions
Javascript, nodejs, react qustions
What people are saying about Paytm
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
HashMap is non-synchronized and allows null values, while Hashtable is synchronized and does not allow null keys or values.
HashMap is non-synchronized, meaning it is not thread-safe, while Hashtable is synchronized and thread-safe.
HashMap allows null values and one null key, while Hashtable does not allow null keys or values.
HashMap is generally preferred for non-thread-safe applications, while Hashtable is used in thr
MongoDB is a NoSQL database while SQL is a relational database management system.
MongoDB is schema-less, allowing for flexible data models.
SQL databases use structured query language for defining and manipulating data.
MongoDB is better suited for unstructured or semi-structured data, while SQL is better for structured data.
SQL databases are ACID compliant, ensuring data integrity, while MongoDB sacrifices some ACID pro...
Paytm interview questions for designations
I applied via Referral and was interviewed in Jun 2024. There were 3 interview rounds.
Got an hackerRank test link which consists HTML, CSS, JS, React and DSA question with MCQs.
Get interview-ready with Top Paytm Interview Questions
Medium level one coding question
2 questions in DSA on arrays and linked list
LinkedIn List based problems involve manipulating linked lists to solve various coding challenges.
Implement common linked list operations like insertion, deletion, and traversal.
Solve problems involving reversing a linked list, detecting cycles, or finding the intersection point of two linked lists.
Use techniques like two pointers, recursion, or hash tables to optimize solutions.
Rotate a linked list by k positions
Traverse the linked list to find the length and the last node
Connect the last node to the head to make it a circular linked list
Traverse again to find the new tail node at position length - k % length
Set the new head as the next node of the new tail and update the new tail's next to null
Use binary search to find the pivot point and then search for the target element in the appropriate half of the array.
Find the pivot point where the array is rotated
Use binary search to search for the target element in the appropriate half of the array
Handle cases where the target element is not found
3 Interview rounds
based on 178 reviews
Rating in categories
Team Lead
2k
salaries
| ₹2 L/yr - ₹9.2 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹10 L/yr - ₹41 L/yr |
Software Engineer
1.4k
salaries
| ₹5.5 L/yr - ₹23 L/yr |
Sales Executive
960
salaries
| ₹1 L/yr - ₹6.4 L/yr |
Senior Associate
903
salaries
| ₹2.1 L/yr - ₹9 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik