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

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.

  • Q1. 

    Minimum Cost Path Problem Statement

    Given an N x M matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y) and ends at the top left corner of t...

  • Ans. 

    The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.

    • Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.

    • Consider the three possible moves: down, right, and down-right diagonal.

    • Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.

    • Finally, the mini...

  • Answered by AI
  • Q2. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use backtracking to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures, oops and networking.

  • Q1. 

    Character Counting Challenge

    Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...

  • Ans. 

    Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.

    • Read characters from input stream until '$' is encountered

    • Count lowercase alphabets, digits, and white spaces separately

    • Print the counts of each character type as three integers separated by spaces

  • Answered by AI
  • Q2. 

    K Largest Elements Problem Statement

    Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.

    Input:

    The fir...
  • Ans. 

    Find K largest elements in an unsorted array and return them in non-decreasing order.

    • Sort the array in non-decreasing order.

    • Return the last K elements of the sorted array.

  • Answered by AI
  • Q3. How can you check whether you have an internet connection on your system?
  • Ans. 

    To check internet connection on a system, you can use various methods like pinging a website or checking network status.

    • Use ping command to check connectivity to a website (e.g. ping www.google.com)

    • Check network status using network settings or command line tools

    • Try accessing a website or online service to verify internet connection

  • Answered by AI
  • Q4. What happens when you type a URL in a web browser?
  • Ans. 

    When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.

    • Browser checks cache for DNS resolution

    • If not found, browser sends a DNS query to resolve the domain name to an IP address

    • Browser establishes a TCP connection with the server

    • Browser sends an HTTP request to the server for the webpage

    • Server processes the...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures, oops and networking.

  • Q1. 

    Counting Sort Problem Statement

    Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?

    Example:

    Input:
    ...
  • Ans. 

    Implement counting sort algorithm to sort an array of integers without comparisons.

    • Count the frequency of each element in the input array.

    • Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.

    • Place each element in its correct position based on the prefix sum.

    • Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.

    • Example: ...

  • Answered by AI
  • Q2. What are the applications of the Fibonacci series in real life?
  • Ans. 

    The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.

    • Used in algorithms for optimization problems and dynamic programming.

    • Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.

    • Applied in financial markets for predicting stock prices and analyzing market trends.

    • Utilized in art and design for creating

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round where the interviewer asked questions to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

  • 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 with a particular sum exists

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

    • Check if the value at the end of the iteration is true for the given K

  • Answered by AI
  • Q2. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Use a queue to keep track of visited nodes and their neighbors.

    • Ensure to print the traversal sequence in the correct order.

    • Handle disconnected components by checking for unvisited nodes.

    • Follow the BFS approach of exploring neighbors before moving to the next level.

  • Answered by AI
Round 2 - HR 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

  • Q1. 

    Replace Spaces in a String

    Given a string STR consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".

    Input:

    The first line contains an integ...
  • Ans. 

    Replace spaces in a string with '@40'.

    • Iterate through each character in the string

    • Replace spaces with '@40'

    • Return the modified string

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview Round with questions based on Data structures, OOPS and SQL.

  • Q1. 

    Delete a Node from a Linked List

    You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.

    Input:

    The first line co...
  • Ans. 

    Implement a function to delete a node from a linked list at a specified position.

    • Traverse the linked list to find the node at the specified position.

    • Update the pointers of the previous and next nodes to skip the node to be deleted.

    • Handle edge cases such as deleting the head or tail of the linked list.

    • Ensure to free the memory of the deleted node to avoid memory leaks.

  • Answered by AI
  • Q2. Write an SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the ORDER BY clause to sort salaries in descending order

    • Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries

    • Combine the above steps in a single query to find the nth highest salary

  • Answered by AI
  • Q3. Can you explain the concepts of Object-Oriented Programming (OOP)?
  • Ans. 

    OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.

    • OOP focuses on creating objects that interact with each other to solve problems.

    • Key concepts include encapsulation, inheritance, and polymorphism.

    • Encapsulation involves bundling data and methods that operate on the data into a single unit.

    • Inheritance allows classes to inherit at...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Was asked me about my favorite technologies, What i liked about Facebook. And asked me to design a cinema ticket reservation web site­ like the one satyam has.

  • Q1. 

    Kth Largest Element Problem

    Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.

    Example:

    Input:
    N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order and return the Kth element.

    • Handle multiple test cases efficiently.

    • Ensure all elements in the array are distinct.

  • Answered by AI
  • Q2. What are virtual functions?
  • Ans. 

    Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.

    • Virtual functions are declared in a base class with the 'virtual' keyword.

    • They are overridden in derived classes using the 'override' keyword.

    • They allow a function to be called based on the runtime type of an object.

    • Virtual functions enable dynamic binding and late binding in C++.

    • Example: virtual void ...

  • Answered by AI
  • Q3. Design a Cinema Ticket Reservation System.
  • Ans. 

    Design a Cinema Ticket Reservation System

    • Use a database to store movie information, showtimes, and seat availability

    • Allow users to search for movies, select showtimes, and choose seats

    • Implement a payment system for ticket purchases

    • Send confirmation emails with QR codes for ticket validation

  • Answered by AI
  • Q4. In how many attempts can you find a defective ball among 10 given balls using a two-pan balance scale?
  • Ans. 

    You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.

    • Divide the 10 balls into two groups of 5 each.

    • Weigh the two groups on the balance scale.

    • If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.

    • Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.

    • Weigh the two groups on the bala...

  • Answered by AI
Round 3 - HR 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

HR round that lasted for about 30 minutes. The interviewer asked me questions to know more about me and a puzzle.

  • Q1. Can you tell me about your projects and your extracurricular activities?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Interview Questions & Answers

PayPal user image RAJIVTEJA NAGIPOGU

posted on 3 Dec 2016

I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.

Interview Questionnaire 

6 Questions

  • Q1. Given an array of numbers find the subset of numbers that give zero sum.
  • Ans. 

    Find subset of numbers in array that sum up to zero.

    • Use a nested loop to iterate through all possible subsets.

    • Calculate the sum of each subset and check if it equals zero.

    • Store the subset if the sum is zero.

    • Optimize the solution by using a hash set to store the cumulative sum of elements.

  • Answered by AI
  • Q2. Explain how bfs works?
  • Ans. 

    BFS (Breadth-First Search) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order.

    • BFS starts at a given vertex and explores all its neighbors before moving to the next level of vertices.

    • It uses a queue data structure to keep track of the vertices to be visited.

    • BFS guarantees that it visits all the vertices of a connected graph.

    • It can be used to find the shortest path between two

  • Answered by AI
  • Q3. Discussion on the projects I have done.
  • Q4. Question on Linked List.
  • Q5. Project Discussion
  • Q6. Strengths and weaknesses. Where do you see yourself in 5 years?
  • Ans. 

    In 5 years, I see myself as a highly skilled software developer, leading a team and contributing to innovative projects.

    • Continuously improving my technical skills through learning and hands-on experience

    • Taking on leadership roles and mentoring junior developers

    • Contributing to the development of cutting-edge software solutions

    • Building strong relationships with clients and stakeholders

    • Staying updated with the latest indu...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

Round: Technical + HR Interview
Experience: I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

College Name: IIT Madras

Skills evaluated in this interview

I applied via Referral

Interview Questionnaire 

13 Questions

  • Q1. Which is my dream company?
  • Q2. What is my biggest achievement till date?
  • Ans. 

    My biggest achievement till date is successfully leading a team to develop and launch a new software product ahead of schedule.

    • Led a team of developers to create a new software product

    • Completed the project ahead of schedule

    • Received positive feedback from clients and stakeholders

  • Answered by AI
  • Q3. How would I handle conflicts with my team members?
  • Ans. 

    I would address conflicts directly and respectfully, seeking to understand the root cause and find a mutually beneficial solution.

    • Listen actively to understand the other person's perspective

    • Communicate clearly and respectfully

    • Identify the root cause of the conflict

    • Brainstorm potential solutions together

    • Be willing to compromise and find a mutually beneficial solution

  • Answered by AI
  • Q4. I have saved money from a year and bought my dream bike. It is the last round of Paypal interview today. I am on my way on the bike and it breaks down in a no parking zone. Suggest a win­win situation so...
  • Q5. What is success according to me?
  • Ans. 

    Success is achieving personal goals, feeling fulfilled, and making a positive impact.

    • Success is subjective and can vary from person to person.

    • It involves setting and achieving goals, both short-term and long-term.

    • Feeling fulfilled and content with one's accomplishments is a key aspect of success.

    • Making a positive impact on others or the world can also be a measure of success.

    • Success is not just about material wealth or...

  • Answered by AI
  • Q6. I was asked to write a code snippet from my project
  • Q7. Program to implement Dijkstra’s algorithm
  • Ans. 

    Dijkstra's algorithm finds the shortest path between nodes in a graph.

    • Create a graph with nodes and edges

    • Assign a tentative distance to each node

    • Set the initial node as current and mark it visited

    • For each neighbor of the current node, calculate the tentative distance

    • If the tentative distance is less than the current distance, update the distance

    • Mark the current node as visited and select the unvisited node with the sma...

  • Answered by AI
  • Q8. Program to reverse a singly linked list
  • Ans. 

    A program to reverse a singly linked list

    • Create a new empty linked list

    • Traverse the original linked list and insert each node at the beginning of the new list

    • Return the new list

  • Answered by AI
  • Q9. Which algorithm would I use to sort a linked list and why? Subsequently, I was asked to explain the logic of merge sort
  • Q10. Suggest as many methods as possible for finding the nth largest element in an unsorted linked list
  • Ans. 

    Methods to find nth largest element in an unsorted linked list

    • Traverse the linked list and store elements in an array, sort the array and return the nth largest element

    • Use quickselect algorithm to find the nth largest element in O(n) time complexity

    • Implement a max heap and extract the nth largest element

    • Divide the linked list into smaller sublists and recursively find the nth largest element

    • Use merge sort to sort the l

  • Answered by AI
  • Q11. How would I explain the concept of prime number to an illiterate?
  • Ans. 

    A prime number is a number that is divisible only by 1 and itself.

    • A prime number has exactly two factors: 1 and itself.

    • Prime numbers cannot be divided evenly by any other number.

    • Examples of prime numbers include 2, 3, 5, 7, 11, 13, 17, etc.

  • Answered by AI
  • Q12. Give a few test cases for a bank transaction
  • Ans. 

    Test cases for a bank transaction

    • Transaction amount within account balance limit

    • Transaction amount exceeds account balance limit

    • Transaction to a valid account number

    • Transaction to an invalid account number

    • Transaction with correct transaction code

    • Transaction with incorrect transaction code

    • Transaction during bank working hours

    • Transaction outside bank working hours

  • Answered by AI
  • Q13. Design classes for educational institutions in a city
  • Ans. 

    Design classes for educational institutions in a city

    • Identify the main entities: schools, students, teachers, courses

    • Create a School class with attributes like name, address, and a list of students and teachers

    • Create a Student class with attributes like name, age, and a list of courses

    • Create a Teacher class with attributes like name, specialization, and a list of courses

    • Create a Course class with attributes like name, ...

  • Answered by AI

Interview Preparation Tips

Skills:
College Name: NA

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Questions about projects
  • Q2. Why Paypal?
  • Ans. 

    Paypal is a leading online payment platform with a strong reputation and global presence.

    • Paypal is a well-established and trusted online payment platform used by millions of users worldwide.

    • It offers secure and convenient payment options for both individuals and businesses.

    • Paypal has a strong focus on innovation and technology, making it an exciting place to work for software engineers.

    • Working at Paypal provides opport...

  • Answered by AI
  • Q3. What does Paypal do?
  • Ans. 

    Paypal is a digital payment platform that allows individuals and businesses to make online transactions.

    • Paypal provides a secure way to send and receive money online.

    • It allows users to link their bank accounts, credit cards, or debit cards to their Paypal account.

    • Users can make payments to merchants or individuals using their Paypal balance or linked payment methods.

    • Paypal offers buyer and seller protection, dispute re...

  • Answered by AI
  • Q4. How do you see yourself in 5 years?
  • Ans. 

    In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.

    • Continuing to enhance my technical skills and knowledge through ongoing learning and certifications

    • Taking on more leadership responsibilities and mentoring junior team members

    • Contributing to the development of cutting-edge software solutions

    • Building strong relationships with colleagues and stakeholders to drive pr

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: One Programming and 15 multiple choice Questions.
Duration: 1 hour 30 minutes
Total Questions: 16

Round: Technical Interview
Experience: All details about projects you have written on resume. Some different implementation of some parts of your project.

Skills: Knowledge about Database Managements Systems, Problem Solving Skills
College Name: IIT Madras

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