Add office photos
i
Paytm
Compare
Filter interviews by
Paytm Software Developer Interview Questions, Process, and Tips
Top Paytm Software Developer Interview Questions and Answers
- Q1. Reverse Linked List Given a singly linked list of integers. Your task is to return the head of the reversed linked list. For example: The given linked list is 1 -> 2 -> 3 ...read more
- Q2. Maximum Subarray Sum Given an array of numbers, find the maximum sum of any contiguous subarray of the array. For example, given the array [34, -50, 42, 14, -5, 86], the ...read more
- Q3. Rotting Oranges You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values: Value 0 - representing an empty cell. Val ...read more
Paytm Software Developer Interview Experiences
36 interviews found
CodingNinjas
I was interviewed in Aug 2021.
(2 Questions)
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
- Q1. Reverse Linked List
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then th... - Ans. Brute Force
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:
&...
- Q2. Sort An Array of 0s, 1s and 2s
You have been given an array/list ARR consisting of ‘N’ elements. Each element in the array is either 0, 1 or 2.
Now, your task is to sort this array/list in increasing ord...
- Ans. NAIVE APPROACH
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)).
Java (SE 1.8)/*
Time Compl...
(2 Questions)
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.
- Q1. Spiral Order Traversal of a Binary Tree
You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.
For example
For the given binary tree [1, 2, 3, -1, -... - Ans. Level Order Traversal
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...
- Q2. Maximum Subarray Sum
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since w...
- Ans. Brute Force Approach
- Create a nested loop. The outer loop will go from i = 0 to i = n - k. This will cover the starting indices of all k-subarrays
- The inner loop will go from j = i to j = i + k - 1. This will cover all the elements of the k-subarray starting from index i
- Keep track of the maximum element in the inner loop and print it.
O(1) because the extra space being used (looping vari...
(1 Question)
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.
- Q1. Operating System based Questions
Questions about scheduling algorithms, dead lock, synchronization etc. were asked.
Interview Preparation Tips
Tip 1 : prepare DSA well
Tip 2 : prepare core subjects well.
Tip 1 : Write internships and projects in detail
Tip 2 : Avoid grammar errors
Skills evaluated in this interview
I was interviewed in Jul 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
2 DSA problems to be solved in 60 min time limit.
- Q1. Next Greater Element
For a given array/list of integers of size N, print the Next Greater Element(NGE) for every element. The Next Greater Element for an element X is the first element on the right side of...
- Ans.
Use stack:
Push the first element to stack.
Pick rest of the elements one by one and follow the following steps in loop.
Mark the current element as next.
If stack is not empty, compare top element of stack with next.
If next is greater than the top element, Pop element from stack. next is the next greater element for the popped element.
Keep popping from the stack while the popped element is smaller than next. next be... - Q2. Floor Value of X
You are 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’ in array ‘A’ is the largest element in th...
- Ans. Linear Search
The idea is to iterate from left to right of the array and compare ‘X’ with the elements of the array, while it is smaller than or equal to ‘X’ then update the answer else stop.
Algorithm :
Let the function be ‘floorSearch(‘A’, ‘X’, ‘N’)’, which returns the floor of ‘X’ in the array ‘A’ of length ‘N’.
- If A[0] is greater than ‘X’ return -1
- Take a variable ‘ans’, that stores the floor value of ...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Face to Face round with interviewer.
- Q1. Longest Common Subsequence
You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.
A String ‘a’ is a subsequence of a String ‘b...
- Ans. Recursive Brute Force
The basic idea of this approach is to break the original problem into sub-problems. Let us assume we want to find the length of the longest common subsequence of “STR1” and “STR2” whose length is ‘N’ and ‘M’ respectively.
Now, let us define a recursive function
LCS(Int I, int J, string STR1, string STR2)
Which returns the length of the longest common subsequence of string STR1...
- Q2. Maximum Subarray Sum
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since w...
- Ans. Brute Force Approach
- Create a nested loop. The outer loop will go from i = 0 to i = n - k. This will cover the starting indices of all k-subarrays
- The inner loop will go from j = i to j = i + k - 1. This will cover all the elements of the k-subarray starting from index i
- Keep track of the maximum element in the inner loop and print it.
O(1) because the extra space being used (looping vari...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Face to Face DSA round.
- Q1. Delete middle node
You have been given a singly Linked List of integers. Your task is to delete the middle node of this List.
Note:
1. If there is no middle node in the list to delete, return an empty ... - Ans. Count Nodes
The idea is simple and naive. We will first count the total number of nodes in the linked list (say ‘N’). Now, we know that the ceil('N' / 2)th node is our middle node of the linked list.
So, now we will follow the traditional algorithm for deleting a node from the linked list. We will traverse till the previous node of the node which is going to be deleted, and point the next pointer of the previ...
- Q2. Group Anagrams Together
You have been given an array/list of strings 'STR_LIST'. You are supposed to return the strings as groups of anagrams such that strings belonging to a particular group are a...
- Ans. Sorting based Approach
The idea behind this approach is that two or more than two strings are anagrams if and only if their sorted strings are equal. So we will use a HashMap, let’s say “anagramGroup”, where each key is a sorted string, and the key will be mapping to the list of indices from the given list of strings that form a group of anagrams. This means that if we sort the strings at those indices, we will get the ...
(1 Question)
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.
- Q1. Job Sequencing Problem
You are given a N x 2 2-D array 'Jobs' of 'N' jobs where Jobs[i][0] denote the deadline of i-th job and Jobs[i][1] denotes the profit associated with i-th job.
You ...
- Ans. Greedy Approach
The idea here is to follow a greedy approach that we should complete the job with the maximum profit in the nearest available slot within its deadline. So, we can sort the jobs in the decreasing order of their profit, and we can maintain a boolean array to keep track of the available slots. So, for each job, we traverse the array backward from the deadline associated with the job to 1, and if any of the ...
Interview Preparation Tips
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.
Skills evaluated in this interview
I was interviewed in Feb 2021.
(2 Questions)
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).
- Q1. Container with most water
Given a sequence of ‘N’ space-separated non-negative integers A[1],A[2],A[3],......A[i]…...A[n]. Where each number of the sequence represents the height of the line drawn at poin...
- Ans. Brute Force Approach
Since we need to find the container with most water, let us try to find all possible containers and choose the one which has the maximum area.
So how can we find the area of all possible containers?
We can, for each line with the position ‘i’ find another line ‘j’ such that ‘j’ > ‘i’ and find the amount of water contained i.e (‘j’-’i’)*min('A[i]', ‘A[j]’) where ‘A[i]’ and ‘A[j]’ represents the heig...
- Q2. Maze obstacles
Given a ‘N’ * ’M’ maze with obstacles, count and return the number of paths to reach the right-bottom cell from the top-left cell. A cell in the given maze has a value -1 if it is a blockage...
- Ans. Recursion
We can observe that we can reach cell (i, j) only through two cells if they exist -
(i - 1, j) and (i, j - 1). Also if the cell (i, j) is blocked we can simply calculate the number of ways to reach it as zero.
So if we know the number of ways to reach cell (i - 1, j) and (i, j - 1) we can simply add these two to get the number of ways to reach cell (i, j).
Let paths(i, j) be the number of ways to reac...
(2 Questions)
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
- Q1. Minimum Fountains
There is a one-dimensional garden of length 'N'. On each of the positions from 0 to 'N', there is a fountain, and this fountain’s water can reach up to a certain range as ...
- Ans. Dynamic programming
- For every fountain, we can try to find the pair area = (left, right), where left and right are the leftmost and the rightmost index respectively where the current fountain can reach.For every index 'I' = 0 to 'I' = 'N' -1, 'LEFT' = max(0, 'I' - 'ARR'['I']) and 'right' = min('I' + ('ARR'['I'] + 1), 'N').
- Now we can sort the array of pairs in non-decreasing order according to 'LEFT' to find the mi...
- Q2. Minimize Cash Flow
You are given a list of ‘transactions’ between ‘n’ number of friends. who have to give each other money. The list consists of data of receiver, sender, and transaction.
Your task is to...
- Ans. Greedy
We can calculate the net amount of every person as-
Net amount = sum of all received money - the sum of all sent money.
Find the person with the maximum and the minimum net amount, suppose ‘x’ person has maximum net amount ‘maxAmount’ and ‘y’ person has a minimum amount ‘minAmount’, then ‘y’ person will pay ‘minAmount’ to ‘x’ person after this transaction net amount of ‘x’ person is ‘maxAmount = maxAmou...
(1 Question)
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.
- Q1. Basic HR Questions
Who is your Ideal?
Why should we hire you?
- Ans.
Tip 1 : Prepare Subjects in Depth for Technical Coding & Interview Round.
Tip 2 : All the Questions were basic in the HR Round ! Be Honest in HR Round as well as Technical Rounds.
Tip 3 : Be Confident in HR Round and don't hesitate while answering and explaining situation based questions.
Tip 4 : It is ok to ask the question again till you don't understand and take the time.
Interview Preparation Tips
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.
Skills evaluated in this interview
I was interviewed in Jun 2021.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
They asked about myself and then started with Android basic and then moved with problem solving questions and scenario based questions
- Q1. Technical Questions
• Flow kotlin
• Android 10 to Android 11 migration support
• Kotlin cons and pros
• Dagger! should we use it?
• MVVM explain
• Andr...
Interview Preparation Tips
Tip 1 : clear all the topics related to Android with deep details
about every topics
Tip 2 : practice dsa and algorithms through leetcode daily
Tip 3 : dry run code before running the code
Tip 1 : 1 page resume with multiple projects along with their links, bonus if app is published to play store
Tip 2 : always write your work experience, your projects and then your education details
Skills evaluated in this interview
Paytm interview questions for designations
I was interviewed in Dec 2020.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1. Lexicographically smallest array
You have been given an array/list ARR consisting of ‘N’ integers. You are also given a positive integer ‘K’.
Your task is to find the lexicographically smallest ARR that ...
- Ans. Greedy Approach
Looking at the problem, we observe that-
- The lexicographically smallest ARR is obtained if the smallest element is present at the beginning i.e ARR[0], followed by the next smallest at index 1 (ARR[1]) and so on.
- The number of swaps to move an element from index ‘i’ to index ‘j’ (where i > j) is i - j as we can swap only neighbouring elements.
- The maximum swaps allowed are ‘K’.
Keeping the above poi...
(1 Question)
Round duration - 20 Minutes
Round difficulty - Easy
- Q1. Basic HR Questions
Who is your role model?
Why should we hire you?
Interview Preparation Tips
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
Skills evaluated in this interview
Get interview-ready with Top Paytm Interview Questions
Anonymous
I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. Write a program to Create a spiral array using 2D-array
- Ans.
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
- Q2. Write a program to find Minimum length of string in 'bdcabdcbaabbbac' containing substring 'abc'
Interview Preparation Tips
Skills evaluated in this interview
I was interviewed before Sep 2020.
(3 Questions)
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.
- Q1. Minimum insertions to make a string palindrome
A palindrome string is one that reads the same backward as well as forward. Given a string 'STR', you need to tell the minimum number of characters ne...
- Ans.
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) - Q2. Closest Leaf To Given Node In Binary Tree
Ninja is stuck in a maze which is in a form of a binary tree. He needs your help in order to get out.
Ninja is presently at the node ‘X’. The only exit points of...
- Ans.
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. - Q3. Add two linked lists
You have been given two singly Linked Lists, where each of them represents a positive number without any leading zeros.
Your task is to add these two numbers and print the summation...
- Ans.
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
(3 Questions)
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.
- Q1. Two Sum
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use t... - Ans.
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 - Q2. Quick Sort
You are given an array of integers. You need to sort the array in ascending order using quick sort.
Quick sort is a divide and conquer algorithm in which we choose a pivot point and partition...
- Ans.
I explained the algorithm of Quick Sort and wrote its code in C++.He also asked me to explain its time complexity.
- Q3. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm - Merge so... - Ans.
I explained the algorithm of Merge Sort and wrote its code in C++.He also asked me to explain its time complexity.
(2 Questions)
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)
- Q1. Inorder Sucessor
You have been given an arbitrary binary tree and a node of this tree. You need to find the inorder successor of this node in the tree.
The inorder successor of a node in a binary tree is...
- Ans.
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.
- Q2. Zig zag traversal
You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to print the zigzag traversal of the given tree.
Note:
In zigzag order, level 1... - Ans.
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...
(1 Question)
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.
- Q1. Camel and banana puzzle
A person has 3000 bananas and a camel. He wants to transport the maximum number of bananas to a destination 1000 KMs away, using only the camel as a mode of transportation. The camel...
- Ans.
Tip 1 : Instead of traveling the full distance in one go, divide the distance into 2/3 Parts.
Tip 2 : Try to maintain the number of remaining bananas multiple of 1000 at each intermediate point.
Interview Preparation Tips
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
Skills evaluated in this interview
Aim2Crack
I was interviewed before Sep 2020.
(3 Questions)
Round duration - 70 minutes
Round difficulty - Medium
Timing: 6:00 pm
3 coding questions of medium to be solved in 70 minutes.
- Q1. Maximum Subarray Sum
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since ...
- Ans. Brute Force Approach
- Create a nested loop. The outer loop will go from i = 0 to i = n - k. This will cover the starting indices of all k-subarrays
- The inner loop will go from j = i to j = i + k - 1. This will cover all the elements of the k-subarray starting from index i
- Keep track of the maximum element in the inner loop and print it.
O(1) because the extra space being used (looping vari...
- Q2. Closest Leaf To Given Node In Binary Tree
Ninja is stuck in a maze which is in a form of a binary tree. He needs your help in order to get out.
Ninja is presently at the node ‘X’. The only exit points of...
- Ans. Traverse All The Subtrees of Ancestors And Node 'X'
The important point to understand here is that the closest leaf can either be a descendent of the given node ‘X’ or can be reached through one of the ancestors of the given node ‘X’. The idea is to traverse the given tree in preorder until the given node ‘X’ is found. While traversing the tree to find the node ‘X’, store the ancestors of node ‘X’ in an array. These anc...
- Q3. Rotting Oranges
You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values:
- Value 0 - representing an empty cell.
- Value 1 - representing a fresh...
- Ans. Naïve Solution
The idea is very simple and naive. We will process the rotten oranges second by second. Each second, we rot all the fresh oranges that are adjacent to the already rotten oranges. The time by which there are no rotten oranges left to process will be our minimum time.
In the first traversal of the grid, we will process all the cells with value 2 (rotten oranges). We will also mark their adjacent cells ...
(1 Question)
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.
- Q1. Find Smallest Integer
You are given an array 'ARR' consisting of 'N' positive numbers and sorted in non-decreasing order, and your task is to find the smallest positive integer value that c...
- Ans.
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...
(1 Question)
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.
- Q1. Bottom Right View of Binary Tree
Given a binary tree. Your task is to print the bottom right view of the binary tree.
Bottom right view, on viewing the given binary tree at the angle of 45 degrees from t...
- Ans. Diagonal Traversal
Assign a level to every diagonal.
Return the last node’s value of every level.
You can solve this problem with diagonal traversal, To know more about ‘diagonal level traversal’ follow the link.
Algorithm
- Create an ‘answer’ array, to store the answer for the return part.
- Assign a ‘maxLevel=0’, to track already visited max level.
- Use the recursion function ‘brViewUtil( root, level)’
- It takes ...
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
Timing: 7:00 pm
The interviewer was friendly and in a bit of a hurry.
- Q1. Basic HR Questions
- Ans.
Tip 1: Be confident while you are speaking.
Tip 2: Explain the reason for your choosing something over the other in the project.
Tip 3: Describe how would you have taken the project further if you had more time/resources.Tip 4: Show enthusiasm and desire to learn.
Tip 5: Exhibit leadership skills when describing your experiences.
Tip 6: Be humble and listen to the feedback carefully.
Interview Preparation Tips
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.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
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.
- Q1. Javascript Questions
Main questions that were asked were based on callbacks, promises, Closures, Event loop.
Some output guessing questions :
1. Difference between let, var, const
2. ES6 features
3. Hoisting
4. ... - Ans.
Tip 1: You just need to be strong in your fundamentals
Tip 2: If you're applying for a specific role like Frontend in my case then any projects in the frontend technology will give you some experience. So do try to make projects if you're learning some new language. - Q2. Project Questions
Questions related to my project were asked.
I had made a carpool app as my internship project in React Native, Node.js and Mongo DB.
So mainly questions were from them.
1. SQL vs NoSQL
2. Even... - Ans.
Answers to project-related questions in an SDE - 1 interview
SQL is a relational database management system, while NoSQL is a non-relational database management system
Event loop is a mechanism that allows asynchronous programming in JavaScript
Synchronous operations block the execution until they complete, while asynchronous operations allow the program to continue executing while waiting for a response
(3 Questions)
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.
- Q1. Find subarray with given sum
Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the...
- Ans.
I solved it using simple approach of O(n2) complexity. Interviewer didn't asked me for the efficient approach, as he looked satisfied and moved to the question.
- Q2. Minimum number of platforms required
You have been given two arrays, 'AT' and 'DT', representing the arrival and departure times of all trains that reach a railway station.
Your task is t...
- Ans.
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 ...
- Q3. Javascript Basics and Redux
He asked me some output questions which were based on JavaScript fundamentals like hoisting, arrow function etc.
Some questions were from Redux. At that time I didn't have any exp... - Ans.
Tip 1: While solving questions do ask questions you have.
Tip 2: Try to make a two way conversation, wherein you are explaining and asking questions side by side.
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
- Q1. Managerial Round
He asked me some JavaScript questions again and also told me about the work culture of his team. It was more like an open discussion with some tech questions
- Ans.
Tip : Be open to discuss any questions related to the technologies or work you're going to have if you get selected.
(1 Question)
Round duration - 15 minutes
Round difficulty - Easy
- Q1. HR Round
Some general HR questions.
1. Why paytm
2. Expected salary
3. Last drawn salary ( if applicable ) - Ans.
Tip 1: Ask questions related to salary openly. Negotiate properly ( if applicable ) ( As in my case I was a fresher so they have fixes CTC for that )
Tip 2: Ask their Employee policies and benefits.
Interview Preparation Tips
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.
Skills evaluated in this interview
Paytm Interview FAQs
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.
Tell us how to improve this page.
Paytm Interviews By Designations
- Paytm Software Engineer Interview Questions
- Paytm Team Lead Interview Questions
- Paytm Senior Software Engineer Interview Questions
- Paytm Software Developer Interview Questions
- Paytm Sales Executive Interview Questions
- Paytm Field Sales Executive Interview Questions
- Paytm Key Account Manager Interview Questions
- Paytm Business Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
Paytm Software Developer Interview Process
based on 13 interviews in last 1 year
3 Interview rounds
- Coding Test Round
- Technical Round
- One-on-one Round
Top Skills for Paytm Software Developer
People are getting interviews through
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Paytm Software Developer Reviews and Ratings
based on 48 reviews
Rating in categories
|
Team Lead
2k
salaries
|  ₹2 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 - ₹41 L/yr |
|
Sales Executive
957
salaries
| ₹1 L/yr - ₹6.4 L/yr |
|
Senior Associate
903
salaries
| ₹2.1 L/yr - ₹9 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik
Calculate your in-hand salary
- Home >
- Interviews >
- Paytm Interview Questions >
- Paytm Software Developer Interview Questions
