i
Paytm
Filter interviews by
I was interviewed in Nov 2021.
Round duration - 50-60 minutes
Round difficulty - Medium
Timing: 50-60 mins (Second half)
Interviewer was cool and focussed on DSA.
Given a reference to a node in a singly linked list, your task is to delete that node. Every node in the list has a unique value. The head of the linked list will not be pro...
I have already done this question before so knew the approach for same.
Step 1: Traversed the LL from start till n-k element
Step 2: And then changes the next for the node.
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
The binary tree is represented i...
We can use level order traversal (recursive) to explore all levels of the tree. Also, at each level nodes should be printed in alternating order.
For example - The first level of the tree should be printed in left to the right manner, the Second level of the tree should be printed in right to the left manner, Third again in left to right order and so on
So, we will use a Direction v...
Round duration - 60 Minutes
Round difficulty - Medium
Your task is to create a deep copy of a linked list, where each node has two pointers: one that points to the next node in the list, and a 'random' pointer which can ...
1) Create all nodes in copy linked list using next pointers.
2) Store the node and its next pointer mappings of original linked list.
3) Change next pointer of all nodes in original linked list to point to the corresponding node in copy linked list.
4) Change the arbit pointer of all nodes in copy linked list to point to corresponding node in original linked list.
5) Now construct the arbit pointer in cop...
Round duration - 60 Minutes
Round difficulty - Medium
Round duration - 60 minutes
Round difficulty - Medium
Basic HR questions
Tip 1 : Prepare the most frequently asked DSA questions first.
Tip 2 : Prepare well your previous and current project.
Tip 3 : Do not rush for HARD questions, Do start with filtering question based on topic and once you are confident in topics pick question company wise.
Tip 1 : ONE PAGE RESUME
Tip 2 : Highlight the project descriptions and skills you are good in.
I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.
Online interview with question on binary search and trees
I was interviewed in Aug 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Their were 3 DSA coding questions of medium and hard level. I need to solve them in 70 minutes. Coding questions were of Arrays, Linked list and Binary search trees
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.
Steps:
&...
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
Simply, we will sort the array.
Space Complexity: O(1)Explanation:O(1), i.e. constant space complexity.
Since we are not using any extra space. Hence, the space complexity is constant.
Time Complexity: O(nlogn)Explanation:O(Nlog(N)), where N is the length of the array/list.
Since we are using the inbuilt sort function. Hence, the time complexity is O(Nlog(N)).
/*
Time Compl...
Round duration - 60 Minutes
Round difficulty - Medium
This round was majorly focused on problem solving skills and DSA. Interviewer asked me three DSA questions of medium and hard level. He started with the hard question, he asked me zig-zag binary tree traversal. we discussed the approach than I coded it and explained its Time and space complexity. Than he asked me max sum subarray modified question, I solved it using Kadane algorithm. Than he discussed one of my online assesments question and asked me to further optimize that approach that I used in the online test. Than I optimized that approach and coded that. Than he asked me for any questions and we dropped the call.
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
The binary tree is represented i...
We can use level order traversal (recursive) to explore all levels of the tree. Also, at each level nodes should be printed in alternating order.
For example - The first level of the tree should be printed in left to the right manner, the Second level of the tree should be printed in right to the left manner, Third again in left to right order and so on
So, we will use a Direction v...
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
O(1) because the extra space being used (looping vari...
Round duration - 40 Minutes
Round difficulty - Medium
This round was mainly focused on operating systems, DBMS and past projects. we started with the introduction. Interviewer asked me explain a functionality of one of my projects that I wrote in my resume, I done that than he started asking OS and DBMS questions. After that we asked me about any bad experience in my past internship, I told that than he asked for any questions to me and we dropped the call and after 2 days I got HR mail that I'm selected.
Tip 1 : prepare DSA well
Tip 2 : prepare core subjects well.
Tip 1 : Write internships and projects in detail
Tip 2 : Avoid grammar errors
I was interviewed in Jul 2021.
Round duration - 60 minutes
Round difficulty - Easy
2 DSA problems to be solved in 60 min time limit.
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
Given a sorted array A
and an integer X
, your task is to find and return the floor value of X
in the array.
The floor value of X
is the largest element in array A
which...
Round duration - 60 minutes
Round difficulty - Medium
Face to Face round with interviewer.
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
Round duration - 60 minutes
Round difficulty - Medium
Face to Face DSA round.
You are given a singly linked list of integers. The task is to delete the middle node of this list.
1. If the list has no middle node, return an empty list (NU...
Given an array/list of strings STR_LIST
, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.
Round duration - 60 minutes
Round difficulty - Easy
This round was with VP (technology).
1. One DSA problem.
2. Had a discussion on the projects mentioned in CV.
3. Theory Ques from DBMS, OS.
You are provided with a N x 2 2-D array called Jobs
consisting of N
jobs. In this array, Jobs[i][0]
represents the deadline of the i-th job, while Jobs[i][1]
indicates the...
Tip 1 : Be clear with your Basics
Tip 2 : 20-25 Questions from every DSA topic are enough to crack.
Tip 3 : Be clear with the intuition behind every problem.
Tip 1 : Must have projects in your Resume if there are no internships.
Tip 2 : Do not put false things on resume.
Paytm interview questions for designations
I was interviewed in Feb 2021.
Round duration - 75 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
Given a sequence of 'N' space-separated non-negative integers A[1], A[2], ..., A[i], ..., A[n], where each number in the sequence represents the height of a lin...
Given an N * M grid representing a maze with obstacles, compute and return the total number of distinct paths from the top-left cell to the bottom-right cell. A cell in the...
Round duration - 100 minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair : Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 10:00 A.M to 12:00 P.M
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...
You are provided with a list of 'transactions' involving 'n' friends who owe each other money. Each entry in the list contains information about a receiver, sender, and the tran...
Round duration - 30 minutes
Round difficulty - Easy
This was a Telephonic Round (Audio Call). The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.
Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : Try practicing medium difficulty level coding questions more.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
Get interview-ready with Top Paytm Interview Questions
I was interviewed in Dec 2020.
Round duration - 60 Minutes
Round difficulty - Easy
You are given an array ARR
of 'N' integers and a positive integer 'K'.
Your task is to determine the lexicographically smallest array that can be obtain...
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Try solving Love Babbar 450 Prog questions
Tip 2 : Have a good resume
Tip 3 : Do learn some extra technologies eg. ML/AI
Tip 1 : Do not lie at all
Tip 2 : Have some projects listed
I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.
Program to create a spiral array using 2D-array
Create a 2D-array with given dimensions
Initialize variables for row, column, and direction
Fill the array in a spiral pattern by changing direction when necessary
Return the spiral array
I was interviewed before Sep 2020.
Round duration - 70 minutes
Round difficulty - Easy
The first round was the Online Coding Round of 70 minutes with 3 problems of 3 marks, 3 marks, and 4 marks respectively.
The first two questions were easy and the third one was a bit tricky. The round started at 6 PM.
Anyone who is practicing continuously could have solved these questions easily within the time limit. The test cases were also not so hard and distinct. I coded in C++ language.
The questions asked were-
1. Minimum insertions required to make a string palindrome
2. To find the distance of the closest leaf from a node with given data.
3. Add two numbers represented by linked lists
22 students were selected for the next round.
Determine the minimal number of characters needed to insert into a given string STR
to transform it into a palindrome.
STR = "abcaa"
I used a recursive approach to solve the problem.
Let's say we have a string S[L.......H].
Then our solution can be found as-
if(S[L]==S[H])
minInsertion(S[L+1....H-1]
else (minInsertion(S[L....H-1]), minInsertion(S[L+1....H])+1)
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...
I used a simple traverse approach to solve the question.
The idea was to first traverse the subtree rooted with give node and find the closest leaf in this subtree. Store this distance. Now traverse tree starting from root. If given node x is in left subtree of root, then find the closest leaf in right subtree, else find the closest left in left subtree.
Given two singly linked lists, with each list representing a positive number without leading zeros, your task is to add these two numbers and return the result in the form of a new...
I used an optimized approach to solve it.
1. Reverse Both Lists
2. Now traverse both lists and add numbers
3. Reverse resultant linked list and return head
Round duration - 80 minutes
Round difficulty - Easy
It was a technical interview. The platform used was google meet for online video calling. The interviewer first introduced himself then asked me to introduce myself. He also asked about my well-being amid the Covid-19 pandemic. He asked me 3 problems from data structures. He put a lot of focus on my project. We discussed about my project for about 20 mins. He asked various questions related to my project and I answered them confidently. After 70-75 mins he said that interview was over and that I may ask him anything. I asked him to give me feedback about my resume and my project. He gave me advice to improve my resume and the interview was over. The first technical interview was easy and was not so challenging as I was prepared.
Given an array of integers ARR
with length 'N' and an integer 'Target', the task is to find all unique pairs of elements that add up to the 'Target'.
First line: Integer...
It is quite an easy problem if you know about arrays.
1. Firstly I sorted the array
2. Then I took 2 pointers.
3. I iterated one from start and other from end and checked sum at each step.
4. I returned the value of element if sum equals K else continue until start<= last
Sort the given array of integers in ascending order using the quick sort algorithm. Quick sort is a divide-and-conquer algorithm where a pivot point is chosen to partition the...
I explained the algorithm of Quick Sort and wrote its code in C++.He also asked me to explain its time complexity.
Given a sequence of numbers, denoted as ARR
, your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
I explained the algorithm of Merge Sort and wrote its code in C++.He also asked me to explain its time complexity.
Round duration - 60 minutes
Round difficulty - Medium
This was also a technical round. The interviewer focused on data structures and resume. Apart from some basic questions about my resume, he asked majorly about data structures and algorithms. The interview was an hour long and he asked only 2 problems. Both of them were from trees. In this round, he focused if I can change my approach if a slight change is made in the question. Like he asked me to write code for inorder traversal. Obviously, I used a recursive approach. He then asked me to use the iterative method to find inorder traversal of the tree.
The questions he asked were-
1. Inorder traversal (both recursive and iterative method)
2. Level Order Traversal
( For obvious reasons I knew level order traversal very well. I coded it swiftly, so he asked me to write code for Zig-Zag traversal)
Find the inorder successor of a given node in a binary tree. The inorder successor is the node that appears immediately after the given node during an inorder traversal....
1) Create an empty stack S.
2) Initialize current node as root
3) Push the current node to S and set current = current->left until current is NULL
4) If current is NULL and stack is not empty then
a) Pop the top item from stack.
b) Print the popped item, set current = popped_item->right
c) Go to step 3.
5) If current is NULL and stack is empty then we are done.
Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.
In zigzag order, level 1 is printed from left to right...
1. Zigzag traversal can be implemented using two stacks.
2. Keep track of the direction to traverse using the bool variable isLtoR. If isLtoR is true, then the current level needs to be traversed from left to right and vice versa.
3. Push the root node into curr and set isLtoR to false for the next level.
4. Pop a node from curr and store it in the variable temp. Deduce the direction from isLtoR and decide, depending on t...
Round duration - 50 minutes
Round difficulty - Medium
This was the final round of the Interview process. My interview was scheduled for 7.30 PM. It started at approximately 7.40 PM. The main focus of the interviewer was on my projects and my skills. He asked me many questions regarding my project like what problems I faced, what did you learn from this, apart from developing skills what else did you learn while developing the project, why did you use this tech instead of this, security features, scalability of the project and many more. I answered almost every question as perfectly as I can. Later he asked me some basic questions from NodeJS (as I am a full stack developer). In the end, he asked a puzzle. I didn't know the solution to the puzzle but we discussed it and I figured out the solution.
Tip 1 : Properly grasp Data Structures and Algorithms from basics.
Tip 2 : Learn about Time complexity
Tip 3 : Be honest and walk through your thought process to the interviewer.
Tip 4 : Its always good to be presentable and have good communications skills
Tip 1 : Never Lie on your resume. Only write what you have done and what you know.
Tip 2 : It's good to have one or two projects on your resume. Mention the tech stack you used and a brief description of the project. It will be best if you host/upload your project on the cloud.
Tip 3 : Avoid unnecessary details like Hobbies, family details, declaration, date, signature, etc.
Tip 4 : You're more than a 1-page resume. But your resume should not be more than a page
I was interviewed before Sep 2020.
Round duration - 70 minutes
Round difficulty - Medium
Timing: 6:00 pm
3 coding questions of medium to be solved in 70 minutes.
Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.
The first line of input contains the size of the arr...
Find the maximum sum of any contiguous subarray in an array of numbers in O(N) time.
Use Kadane's algorithm to find the maximum subarray sum in O(N) time.
Initialize two variables: maxEndingHere and maxSoFar to keep track of the maximum sum.
Iterate through the array and update the variables accordingly.
Return the maxSoFar as the result.
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...
Find the minimum distance from a given node to the nearest leaf node in a binary tree.
Traverse the binary tree from the given node 'X' to find the nearest leaf node.
Use a queue for level order traversal to efficiently find the nearest leaf node.
Calculate the distance from node 'X' to each leaf node and return the minimum distance.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process of oranges.
Track the time taken to rot all fresh oranges and return the result.
If any fresh oranges remain after simulation, return -1 as it is impossible to rot all oranges.
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was friendly, encouraging, and humble.
Given a non-decreasing sorted array ARR
of N
positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...
The task is to find the smallest positive integer value that cannot be represented as a sum of elements of any proper subset of the given array.
The array is sorted in non-decreasing order, so we can iterate through the array and keep track of the maximum sum we can form.
If the current element is greater than the maximum sum + 1, then the maximum sum + 1 is the smallest positive integer that cannot be represented.
If all...
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was not speaking much. It was a bit strange.
Your task is to identify and return the bottom right view of a given binary tree.
This involves viewing the binary tree from an angle of 45 degrees from...
Identify and return the bottom right view of a given binary tree by viewing it from an angle of 45 degrees from the bottom right side.
Traverse the binary tree in a right-to-left manner and keep track of the last node encountered at each level.
Use a queue for level order traversal and update the result array with the last node at each level.
Return the result array sorted in ascending order as the bottom right view of th
Round duration - 30 Minutes
Round difficulty - Easy
Timing: 7:00 pm
The interviewer was friendly and in a bit of a hurry.
Tip 1 : DSA is the key. Starting from scratch, one can become proficients in a couple of months.
Tip 2 : Solve questions just a bit outside your comfort zone. Solve too easy to too hard questions is not of any use.
Tip 3 : Be consistent, make a habit of following good coding practices.
Tip 4 : Get to know the ins and out of your projects. You must be very confident while explaining those.
Tip 5 : Don't just directly to system-design, brush up on OOPS principles, networks, OS, DBMS before that.
Tip 1: Keep it crisp and to the point. Make bullet points.
Tip 2: Bold the things you want to be paid attention to. Use numbers rather than vague sentences.
Tip 3: Only put the things you are confident about.
Tip 4: Don't put things irrelevant to the job, it only dilutes the main content.
I was interviewed before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
I applied thorough LinkedIn and got a call from HR for the interview.
I went to their Noida Office.
First round was mainly focused on Javascript fundamentals.
Interviewer was also friendly.
Round duration - 1 hour
Round difficulty - Medium
Second round was after 15 minutes of the first round. The focus of this round was DS & Algorithms.
Given an array ARR
of N
integers and an integer S
, determine if there exists a subarray (of positive length) within the given array such that the sum of its elements equals S
....
Given an array and a target sum, find a subarray that sums up to the target sum.
Iterate through the array while keeping track of the running sum and the starting index of the subarray.
Use a hashmap to store the running sum and its corresponding index.
If the running sum - target sum is found in the hashmap, it means a subarray with the target sum exists.
Return the starting and ending indices of the subarray or [-1, -1]
You are provided with two arrays, AT
and DT
, representing the arrival and departure times of all trains arriving at a railway station.
Your task is to determine the m...
This question asks to find the minimum number of platforms required at a railway station so that no train needs to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize a variable 'platforms' to 1 and 'maxPlatforms' to 1.
Iterate through the arrival and departure times arrays simultaneously.
If the current arrival time is less than or equal to the current departure time, increment 'platforms'.
If ...
Round duration - 30 minutes
Round difficulty - Easy
The interviewer asked about JavaScript questions and the work culture of the team during the managerial round.
JavaScript questions related to closures, prototypes, event handling, and asynchronous programming may have been asked.
Work culture may involve collaboration, innovation, agile methodologies, and continuous learning.
Examples of work culture could include regular team meetings, code reviews, hackathons, and ment
Round duration - 15 minutes
Round difficulty - Easy
Tip 1 : Be strong at your basics.
Tip 2 : Don't hesitate to ask questions to interviewer.
Tip 3 : Prepare good for DS & Algo as most companies have a separate round for it.
Tip 1: If possible make 1 page resume
Tip 2: Don't put too many things. Keep it simple. If you're a fresher and have good projects, do put them before your academic section.
Tip 3: Be ready to explain everything you have in your resume.
Some of the top questions asked at the Paytm Software Developer interview -
The duration of Paytm Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 24 interviews
4 Interview rounds
based on 48 reviews
Rating in categories
Team Lead
2.3k
salaries
| ₹2.5 L/yr - ₹11.4 L/yr |
Software Engineer
1.4k
salaries
| ₹6 L/yr - ₹23 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹10 L/yr - ₹40 L/yr |
Sales Executive
974
salaries
| ₹1 L/yr - ₹6.4 L/yr |
Senior Associate
912
salaries
| ₹2.2 L/yr - ₹8.4 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik