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

Clear (1)

Paytm Software Developer Intern Interview Questions, Process, and Tips

Updated 16 Sep 2021

Top Paytm Software Developer Intern Interview Questions and Answers

  • Q1. Parth's OCD Challenge Parth, a budding programmer, has received an array 'ARR' of 'N' positive integers. His OCD is triggered whenever an odd number appears at an even i ...read more
  • Q2. Find All Occurrences in Matrix You are provided with a matrix of characters, CHARACTER_MATRIX of size M x N , and a string WORD . Your goal is to locate and display all ...read more
  • Q3. Diagonal Traversal of a Binary Tree Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal. Example: ...read more
View all 11 questions

Paytm Software Developer Intern Interview Experiences

4 interviews found

I was interviewed in Feb 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. 

    Binary Tree Diameter Problem Statement

    Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two end nodes in the tree. The path's length is re...

  • Ans. 

    The diameter of a binary tree is the longest path between any two end nodes in the tree.

    • Traverse the tree to find the longest path between two leaf nodes.

    • Use depth-first search (DFS) to calculate the height of each subtree.

    • The diameter is the sum of the heights of the left and right subtrees + 1.

  • Answered by AI
  • Q2. 

    Find All Pairs Adding Up to Target

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

    Input:

    The first line ...
  • Ans. 

    Given an array of integers and a target, find all pairs of elements that add up to the target.

    • Iterate through the array and for each element, check if the target minus the element exists in a hash set.

    • If it does, add the pair to the result. If not, add the element to the hash set.

    • Handle cases where the same element is used twice in a pair.

    • Return (-1, -1) if no pair is found.

  • Answered by AI
Round 2 - HR 

Round duration - 35 minutes
Round difficulty - Medium

The nature of the interviewer was very kind, helped me when I stuck. The round was proctored, our webcam and mic were on, and shared my screen.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in HyderabadEligibility criteriaabove 7 cgpa, no backlogsPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, C++, DevelopmentTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Do at least 1 projects at any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP

Application resume tips for other job seekers

Tip 1 : At least mention the projects or internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 70 minutes
Round difficulty - Easy

  • Q1. 

    Parth's OCD Challenge

    Parth, a budding programmer, has received an array 'ARR' of 'N' positive integers. His OCD is triggered whenever an odd number appears at an even index or an even number at an odd in...

  • Ans. 

    Reorder array to avoid odd numbers at even indices and even numbers at odd indices.

    • Swap odd numbers at even indices with the nearest odd number at an odd index.

    • Swap even numbers at odd indices with the nearest even number at an even index.

    • Maintain counts of odd and even numbers to ensure equal distribution.

  • Answered by AI
  • Q2. 

    Find All Occurrences in Matrix

    You are provided with a matrix of characters, CHARACTER_MATRIX of size M x N, and a string WORD. Your goal is to locate and display all occurrences of the string within the ...

  • Ans. 

    Find all occurrences of a given string in a matrix in all eight possible directions.

    • Iterate through each cell in the matrix and check for the starting character of the word.

    • For each starting character found, check in all eight directions for the complete word.

    • Keep track of the coordinates of each character in the word for each occurrence.

    • Print the coordinates of each character for all occurrences found.

    • If no occurrence

  • Answered by AI
  • Q3. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.

    • Traverse the binary tree to find the target node.

    • From the target node, perform a depth-first search to find nodes at distance K.

    • Use a recursive function to keep track of the distance from the target node.

    • Return the values of nodes found at distance K in any order.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. 

    Diagonal Traversal of a Binary Tree

    Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.

    Example:

    Explanation:
    Consider lines at a...
  • Ans. 

    Find the diagonal traversal of a binary tree of integers.

    • Traverse the binary tree diagonally using a queue and a map to store nodes at each diagonal level.

    • Use a depth-first search approach to traverse the tree and populate the map with nodes at each diagonal level.

    • Iterate through the map to get the diagonal traversal of the binary tree.

  • Answered by AI
  • Q2. 

    Binary Tree Diameter Problem Statement

    Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two end nodes in the tree. The path's length is re...

  • Ans. 

    The diameter of a binary tree is the longest path between any two end nodes in the tree.

    • Traverse the tree to find the longest path between two leaf nodes.

    • Use depth-first search (DFS) to calculate the height of each subtree.

    • The diameter is the sum of the heights of the left and right subtrees + 1.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Medium

The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.

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

  • Ans. 

    Find the Next Greater Element for each element in a list of integers.

    • Iterate through the list of integers from right to left.

    • Use a stack to keep track of elements whose NGE is yet to be found.

    • Pop elements from the stack until a greater element is found or the stack is empty.

    • Assign the NGE as the top element of the stack or -1 if the stack is empty.

    • Repeat the process for all elements in the list to find their NGEs.

  • Answered by AI
  • Q2. 

    Subset Sum Equal To K Problem Statement

    Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    Provide true if such a subset exists, otherwise r...

  • Ans. 

    Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    • Use dynamic programming to solve this problem efficiently

    • Create a 2D array to store if a subset sum is possible for each element and sum

    • Iterate through the array and update the 2D array accordingly

    • Check if the subset sum for K is possible using the 2D array

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    Given stock prices for 'N' days, find maximum profit with up to two buy-and-sell transactions.

    • Iterate through the array of stock prices to find the maximum profit with two transactions

    • Keep track of the maximum profit by considering all possible buy and sell combinations

    • Ensure to sell the stock before buying again to maximize profit

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from JSS Academy of Technical Education. I applied for the job as SDE - Intern in NoidaEligibility criteriaNo criteriaPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, C++, DevelopmentTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Do at least 1 projects at any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP

Application resume tips for other job seekers

Tip 1 : At least mention the projects or internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I was interviewed in Dec 2020.

Round 1 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. 

    Diagonal Traversal of a Binary Tree

    Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.

    Example:

    Explanation:
    Consider lines at a...
  • Ans. 

    Diagonal traversal of a binary tree involves printing nodes at the same diagonal in a specific order.

    • Traverse the tree in a diagonal manner, starting from the root node and moving towards the right child and then the left child.

    • Use a queue to keep track of nodes at each level of the tree.

    • Print the nodes in each diagonal level in the order they are encountered.

    • Example: For the given binary tree, the diagonal traversal w

  • Answered by AI
  • Q2. 

    Binary Tree Diameter Problem Statement

    You are given a Binary Tree, and you need to determine the length of the diameter of the tree.

    The diameter of a binary tree is the length of the longest path betwe...

  • Ans. 

    The task is to find the diameter of a binary tree, which is the longest path between any two nodes in the tree.

    • Traverse the tree to find the longest path between any two nodes.

    • Keep track of the maximum diameter found during traversal.

    • The diameter may not necessarily pass through the root node.

    • Consider both left and right subtrees while calculating the diameter.

    • Example: For input '1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1',

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.

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

  • Ans. 

    Find the Next Greater Element for each element in a list of integers.

    • Iterate through the list of integers from right to left.

    • Use a stack to keep track of elements for which the Next Greater Element is not yet found.

    • Pop elements from the stack until a greater element is found or the stack is empty.

    • Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.

  • Answered by AI
  • Q2. 

    Subset Sum Equal To K Problem Statement

    Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    Provide true if such a subset exists, otherwise r...

  • Ans. 

    Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store if a subset sum is possible for each element and target sum.

    • Iterate through the array and update the 2D array based on the current element and target sum.

    • Check if the 2D array contains true for the target sum at the end.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

    • Iterate through the array of stock prices and keep track of the maximum profit that can be achieved with two transactions.

    • Maintain variables to store the maximum profit after the first buy-sell, the maximum profit after the second buy-sell, and the minimum price encountered s...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from JSS Academy of Technical Education. I applied for the job as SDE - Intern in NoidaEligibility criteriaNo criteriaPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, C++, DevelopmentTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Do at least 1 projects at any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP

Application resume tips for other job seekers

Tip 1 : At least mention the projects or internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Coding round with 3 coding questions.

  • Q1. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.

    • Traverse the tree to find the target node.

    • From the target node, perform a depth-first search to find nodes at distance K.

    • Use a recursive function to keep track of the distance from the target node.

    • Return the values of nodes found at distance K in any order.

  • Answered by AI
  • Q2. 

    Rahul And Minimum Subarray Challenge

    Rahul is learning about arrays and lists. His teacher gave him a task to find the length of the smallest subarray in a given array 'ARR' of size 'N' with its sum great...

  • Ans. 

    Find the length of the smallest subarray in a given array with sum greater than a given value.

    • Iterate through the array while keeping track of the current subarray sum.

    • Use two pointers technique to find the smallest subarray with sum greater than X.

    • Update the minimum subarray length as you iterate through the array.

    • Return the length of the smallest subarray found.

    • Example: For ARR = [1, 2, 21, 7, 6, 12] and X = 23, the

  • Answered by AI
  • Q3. 

    Encrypt The Digits Problem Statement

    Given a numeric string STR consisting of characters from ‘0’ to ‘9’, encrypt the string by replacing each numeric character according to the mapping:
    ‘0’ -> ‘9’, ‘1’...

  • Ans. 

    Encrypt each digit in a numeric string by replacing it with its encrypted equivalent.

    • Iterate through each character in the string and replace it with its encrypted equivalent

    • Use a mapping to determine the encrypted equivalent of each digit

    • Return the encrypted string for each test case

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Medium

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. 

    Diagonal Traversal of a Binary Tree

    Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.

    Example:

    Explanation:
    Consider lines at a...
  • Ans. 

    Diagonal traversal of a binary tree is finding the nodes in the tree along the diagonals from top-left to bottom-right.

    • Traverse the tree in a diagonal manner, starting from the root node and moving towards the right child and then the left child.

    • Use a queue to keep track of nodes at each level of the tree.

    • Maintain a map to store nodes at each diagonal level and then print the nodes in the map in the required order.

  • Answered by AI
  • Q2. 

    Parth's OCD Challenge

    Parth, a budding programmer, has received an array 'ARR' of 'N' positive integers. His OCD is triggered whenever an odd number appears at an even index or an even number at an odd in...

  • Ans. 

    Reorder array to avoid odd numbers at even indices and even numbers at odd indices.

    • Swap odd numbers at even indices with the nearest odd number at an odd index, and vice versa.

    • Use two pointers approach to iterate through the array and swap elements accordingly.

    • Ensure the array has equal numbers of odd integers and odd-index positions and vice-versa.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. 

    Subset Sum Equal To K Problem Statement

    Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    Provide true if such a subset exists, otherwise r...

  • Ans. 

    Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    • Use dynamic programming to solve this problem efficiently

    • Create a 2D array to store if a subset sum is possible for each element and sum

    • Iterate through the array and update the 2D array accordingly

    • Check if the subset sum for K is possible at the end

  • Answered by AI
  • Q2. 

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

  • Ans. 

    Find the Next Greater Element for each element in a list of integers.

    • Iterate through the list of integers from right to left.

    • Use a stack to keep track of elements whose NGE is yet to be found.

    • Pop elements from the stack until a greater element is found or the stack is empty.

    • Assign the NGE as the top element of the stack or -1 if the stack is empty.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in NoidaEligibility criteriaNo criteriaPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, C++, DevelopmentTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Do at least 1 project in any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP

Application resume tips for other job seekers

Tip 1 : At least mention the projects and internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.

Final outcome of the interviewSelected

Skills evaluated in this interview

Paytm interview questions for designations

 Software Intern

 (1)

 Software Developer

 (35)

 Software Developer Trainee

 (1)

 Senior Software Developer

 (1)

 Backend Developer Intern

 (1)

 Software Development Engineer Intern

 (1)

 Intern

 (1)

 Python Software Developer

 (1)

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Instahyre and was interviewed in Oct 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Basic Nodejs questions

Round 2 - Technical 

(2 Questions)

  • Q1. Live peer coding interview
  • Q2. Fundamental of JS and clean code architecture
Round 3 - HR 

(2 Questions)

  • Q1. Salary expectation
  • Q2. Joining date and

Interview Preparation Tips

Interview preparation tips for other job seekers - Experience was good
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

1 hour test conducted by the company

Round 2 - Group Discussion 

Data structure and all

Interview experience
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.

Round 1 - Coding Test 

All about coding and solving questions

Round 2 - Technical 

(2 Questions)

  • Q1. All about coding questions in depth and follow up questions
  • Q2. Be good in coding

Interview Preparation Tips

Interview preparation tips for other job seekers - Very supportive interviewer. Helps in between to make you comfortable

Interview Questionnaire 

2 Questions

  • Q1. DSA asked overall
  • Q2. Practise all dsa questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Not that hard can be solved with practise

I applied via AngelList and was interviewed before Oct 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - HR 

(2 Questions)

  • Q1. What's your name? Previously working details
  • Q2. Your long term goals?

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare hard guys they are much more expertise in their field

I was interviewed in Mar 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.

  • Q1. 

    Longest Substring with At Most K Distinct Characters

    Given a string S of length N and an integer K, find the length of the longest substring that contains at most K distinct characters.

    Input:

    The first...
  • Ans. 

    Find the length of the longest substring with at most K distinct characters in a given string.

    • Use a sliding window approach to keep track of the characters and their counts within the window.

    • Maintain a hashmap to store the characters and their frequencies.

    • Update the window size and characters count as you iterate through the string.

    • Return the maximum window size encountered for each test case.

  • Answered by AI
  • Q2. 

    Maximum Frequency Number Problem Statement

    Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

    If multip...

  • Ans. 

    Find the number with the maximum frequency in an array of integers.

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Find the number with the maximum frequency and return it.

    • If multiple elements have the same maximum frequency, return the one that appears first.

  • Answered by AI
  • Q3. 

    Ninja and Bombs Problem Statement

    Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...

  • Ans. 

    Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.

    • Check if the x-coordinate is even or odd by using bitwise AND operation with 1.

    • Return 1 if x-coordinate is even, else return 0.

    • Handle multiple test cases by iterating through each input.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I was asked a coding question then, a system design question and some basic operating systems and oops questions

  • Q1. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store seen elements.

  • Answered by AI
  • Q2. Can you design a Google Search Engine?
  • Ans. 

    Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.

    • Develop a web crawler to discover and retrieve web pages.

    • Implement an indexing system to store and organize the content of web pages.

    • Design a ranking algorithm to determine the relevance of search results.

    • Include features like autocomplete, spell check, and personalized search results.

    • Optimize for speed and scalabil...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, System Design, Operating SystemsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms

Application resume tips for other job seekers

Tip 1 : Mention your projects
Tip 2 : Mention your internships

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Recently Viewed

JOBS

Browse jobs

Discover jobs you love

COMPANY BENEFITS

KNR Constructions

20 benefits

COMPANY BENEFITS

IRB Infrastructure

60 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

INTERVIEWS

Tejas Networks

No Interviews

INTERVIEWS

Cairn Oil

No Interviews

INTERVIEWS

Lodha Group

No Interviews

INTERVIEWS

Cummins

No Interviews

INTERVIEWS

IBM

No Interviews

Tell us how to improve this page.

Interview Questions from Similar Companies

PhonePe Interview Questions
4.0
 • 299 Interviews
PayPal Interview Questions
3.9
 • 207 Interviews
Fiserv Interview Questions
3.0
 • 172 Interviews
Visa Interview Questions
3.5
 • 138 Interviews
Angel One Interview Questions
3.9
 • 135 Interviews
MasterCard Interview Questions
3.9
 • 134 Interviews
Revolut Interview Questions
2.5
 • 97 Interviews
View all
Paytm Software Developer Intern Salary
based on 6 salaries
₹4.1 L/yr - ₹15 L/yr
56% more than the average Software Developer Intern Salary in India
View more details

Paytm Software Developer Intern Reviews and Ratings

based on 2 reviews

4.0/5

Rating in categories

5.0

Skill development

3.6

Work-life balance

2.3

Salary

2.6

Job security

4.3

Company culture

2.9

Promotions

5.0

Work satisfaction

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

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
1.4k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
1.4k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Executive
974 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
915 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Paytm with

BharatPe

3.5
Compare

Zerodha

4.1
Compare

Razorpay

3.6
Compare

Mobikwik

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent