Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Paytm Team. If you also belong to the team, you can get access from here

Paytm Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Paytm Software Developer Interview Questions, Process, and Tips

Updated 16 Jan 2025

Top Paytm Software Developer Interview Questions and Answers

  • Q1. Reverse Linked List Problem Statement Given a singly linked list of integers, return the head of the reversed linked list. Example: Initial linked list: 1 -> 2 -> 3 -> 4 ...read more
  • Q2. Rotting Oranges Problem Statement You are given a grid containing oranges where each cell of the grid can contain one of the three integer values: 0 - representing an em ...read more
  • Q3. Delete a Node from Linked List Problem Statement Given a linked list of integers, your task is to implement a function that deletes a node at a specified position, 'POS' ...read more
View all 46 questions

Paytm Software Developer Interview Experiences

34 interviews found

I was interviewed in Nov 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 50-60 minutes
Round difficulty - Medium

Timing: 50-60 mins (Second half)
Interviewer was cool and focussed on DSA.

  • Q1. 

    Delete a Node in a Linked List

    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...

  • Ans. 

    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.

  • Answered Anonymously
  • Q2. 

    Spiral Order Traversal of a Binary Tree Problem Statement

    Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.

    Example:

    Input:
    The binary tree is represented i...
  • 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...

  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Clone Linked List with Random Pointer

    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 ...

  • Ans. 

    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...

  • Answered Anonymously
Round 3 - Video Call 

Round duration - 60 Minutes
Round difficulty - Medium

Round 4 - HR 

Round duration - 60 minutes
Round difficulty - Medium

Basic HR questions

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaNoPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Arrays, Linked List , Stack & Queue, Basic DP questions, OOPS & Threading conceptsTime required to prepare for the interview - 7- 8 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

Tip 1 : ONE PAGE RESUME
Tip 2 : Highlight the project descriptions and skills you are good in.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Online interview with question on binary search and trees

Round 2 - Technical 

(1 Question)

  • Q1. Microservice architecture, Multithreading, HashMap internal working, GC working

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(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 Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • 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:

    &...

  • Answered Anonymously
  • Q2. 

    Problem: Sort an Array of 0s, 1s, and 2s

    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.

    Input:

    The input sta...
  • 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...
  • Answered Anonymously
Round 2 - Face to Face 

(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 Problem Statement

    Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.

    Example:

    Input:
    The binary tree is represented i...
  • 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...

  • Answered Anonymously
  • Q2. 

    Maximum Subarray Sum Problem Statement

    Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Out...
  • Ans. Brute Force Approach
    1. 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
    2. 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
    3. Keep track of the maximum element in the inner loop and print it.
    Space Complexity: O(1)Explanation:

    O(1) because the extra space being used (looping vari...

  • Answered Anonymously
Round 3 - Face to Face 

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.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Maharaja Agrasen Institute Of Technology. I applied for the job as SDE - 1 in PuneEligibility criteriaNAPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structure, Algorithms , OOPs, Operating Systems, Computer Networks, Projects.Time required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : prepare DSA well
Tip 2 : prepare core subjects well.

Application resume tips for other job seekers

Tip 1 : Write internships and projects in detail
Tip 2 :  Avoid grammar errors

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jul 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

2 DSA problems to be solved in 60 min time limit.

  • Q1. 

    Next Greater Element Problem Statement

    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...

  • Q2. 

    Floor Value of X Problem Statement

    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 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Face to Face round with interviewer.

  • Q1. 

    Longest Common Subsequence Problem Statement

    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...

  • Q2. 

    Maximum Subarray Sum Problem Statement

    Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Out...
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Face to Face DSA round.

  • Q1. 

    Delete Middle Node Problem Statement

    You are given a singly linked list of integers. The task is to delete the middle node of this list.

    Note:

    1. If the list has no middle node, return an empty list (NU...
  • Q2. 

    Group Anagrams Together

    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.

    E...

Round 4 - Face to Face 

(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 Statement

    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...

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Dr. Akhilesh Das Gupta Institute of Technology & Management. I applied for the job as SDE - 1 in DelhiEligibility criteriaNo criteriaPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, Operating System, Dynamic ProgrammingTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

Tip 1 : Must have projects in your Resume if there are no internships.
Tip 2 : Do not put false things on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Paytm interview questions for designations

 Software Developer Intern

 (4)

 Software Developer Trainee

 (1)

 Senior Software Developer

 (1)

 Python Software Developer

 (1)

 Developer

 (1)

 Software Engineer

 (51)

 Software Intern

 (1)

 Android Developer

 (4)

I was interviewed in Feb 2021.

Round 1 - Coding Test 

(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 Problem Statement

    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...

  • Q2. 

    Maze Obstacle Problem Statement

    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 2 - Face to Face 

(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 Activation Problem

    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...

  • Q2. 

    Minimize Cash Flow Problem

    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 3 - HR 

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.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in NoidaEligibility criteriaAbove 8 CGPAPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Computer Networks, Computer System Architecture, Operating System, Data Structures, PointersTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Paytm Interview Questions

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Lexicographically Smallest Array Problem Statement

    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 2 - HR 

Round duration - 20 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI completed Electronics & Communication Engineering from Lokmanya Tilak College of Engineering. Eligibility criteria6.75+ CGPAPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, OOPS, DBMS, OOPs, Algorithms, DP, GreedyTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

Tip 1 : Do not lie at all
Tip 2 : Have some projects listed

Final outcome of the interviewRejected

Skills evaluated in this interview

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

  • Answered by AI
  • Q2. Write a program to find Minimum length of string in 'bdcabdcbaabbbac' containing substring 'abc'

Interview Preparation Tips

Interview preparation tips for other job seekers - I recently got interviewed at PAYTM.I felt paytm will check your programming skills rather than your conceptual skills .In beginning they asked few questions related to concepts then they continued with only DS and algo.

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(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

    Determine the minimal number of characters needed to insert into a given string STR to transform it into a palindrome.

    Example:

    Input:
    STR = "abcaa"
    Outp...
  • 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)

  • Answered Anonymously
  • Q2. 

    Closest Leaf in a Binary Tree

    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...

  • 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.

  • Answered Anonymously
  • Q3. 

    Adding Two Linked Lists

    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...

  • 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

  • Answered Anonymously
Round 2 - Video Call 

(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. 

    All Pairs with Target Sum

    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'.

    Input:

    First line: Integer...
  • 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

  • Answered Anonymously
  • Q2. 

    Quick Sort Problem Statement

    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...

  • Ans. 

    I explained the algorithm of Quick Sort and wrote its code in C++.He also asked me to explain its time complexity.

  • Answered Anonymously
  • Q3. 

    Merge Sort Task

    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.

    Example:

    Explanation:
    The Merge Sort...
  • Ans. 

    I explained the algorithm of Merge Sort and wrote its code in C++.He also asked me to explain its time complexity.

  • Answered Anonymously
Round 3 - Video Call 

(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 Successor in a Binary Tree

    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....

  • 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.

     

  • Answered Anonymously
  • Q2. 

    Zigzag Traversal of Binary Tree

    Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.

    Note:

    In zigzag order, level 1 is printed from left to right...
  • 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...

  • Answered Anonymously
Round 4 - Video Call 

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.

Interview Preparation Tips

Eligibility criteriaabove 7 CGPA, No active backlogsPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Dynamic Programming, Recursion, Advanced Data Structures, Operating System, Time complexity analysis and Sorting AlgorithmsTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(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 Problem Statement

    Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.

    Input:

    The first line of input contains the size of the arr...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Closest Leaf in a Binary Tree

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q3. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(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. 

    Smallest Integer Not Representable as Subset Sum

    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...

  • 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...

  • Answered by AI
Round 3 - Video Call 

(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 Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
Round 4 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

Timing: 7:00 pm
The interviewer was friendly and in a bit of a hurry.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Indraprastha Institute of Information Technology Delhi. I applied for the job as SDE - 1 in DelhiEligibility criteriaNone except no active backlogsPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DP, OOPS, Operating Systems, Computer Networks, DBMSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Face to Face 

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 2 - Face to Face 

(2 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, determine if there exists a subarray (of positive length) within the given array such that the sum of its elements equals S....

  • Ans. 

    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]

  • Answered by AI
  • Q2. 

    Minimum Number of Platforms Required

    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...

  • 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 ...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

  • Q1. What JavaScript questions did he ask you during the managerial round, and can you describe the work culture of his team?
  • Ans. 

    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

  • Answered by AI
Round 4 - Face to Face 

Round duration - 15 minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaI applied for Frontend role so Javascript was needed.Paytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - JavaScript,React.js,Java,Node.js,DS & Algo,Time required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Paytm Interview FAQs

How many rounds are there in Paytm Software Developer interview?
Paytm interview process usually has 2-3 rounds. The most common rounds in the Paytm interview process are Coding Test, Technical and One-on-one Round.
How to prepare for Paytm Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Paytm. The most common topics and skills that interviewers at Paytm expect are Analytics, Animation, Backend Operations, CRM and CSS3.
What are the top questions asked in Paytm Software Developer interview?

Some of the top questions asked at the Paytm Software Developer interview -

  1. Write a function that returns '3' when '4' is passed as an input and vice versa...read more
  2. A 2D matrix is given which is row wise and column wise sorted. Find a particula...read more
  3. Find the odd repeating element from a set of repeating eleme...read more
How long is the Paytm Software Developer interview process?

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 Software Developer Interview Process

based on 24 interviews

4 Interview rounds

  • Coding Test Round
  • Technical Round
  • One-on-one Round
  • HR Round
View more
Paytm Software Developer Salary
based on 235 salaries
₹7.5 L/yr - ₹27.8 L/yr
93% more than the average Software Developer Salary in India
View more details

Paytm Software Developer Reviews and Ratings

based on 48 reviews

3.3/5

Rating in categories

3.5

Skill development

3.2

Work-life balance

3.1

Salary

2.8

Job security

3.0

Company culture

2.6

Promotions

3.0

Work satisfaction

Explore 48 Reviews and Ratings
Team Lead
2.3k salaries
unlock blur

₹2.5 L/yr - ₹11.4 L/yr

Software Engineer
1.4k salaries
unlock blur

₹6 L/yr - ₹23 L/yr

Senior Software Engineer
1.4k salaries
unlock blur

₹10 L/yr - ₹40 L/yr

Sales Executive
974 salaries
unlock blur

₹1 L/yr - ₹6.4 L/yr

Senior Associate
912 salaries
unlock blur

₹2.2 L/yr - ₹8.4 L/yr

Explore more salaries
Compare Paytm with

BharatPe

3.5
Compare

Zerodha

4.2
Compare

Razorpay

3.6
Compare

Mobikwik

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview