Paytm Software Developer Intern Interview Questions, Process, and Tips

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...read more
Ans. Recursion
The basic idea of this approach is to break the problem into subproblems. 
Now, there are three possible cases:
 
1. The diameter of the tree is present in the left subtree.
2. The diameter of the tree is present in the right subtree.
3. The diameter of the tree passes through the root node.
 
Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...read more
Answered Anonymously
Add your answer
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 ...read more
Ans. Hashing Solution
• We can store the frequency of every element in the array in a hashmap.
• We will loop over every index i, and check the frequency of (Target - ARR[i]) is the hashmap:
  • If (Target - ARR[i]) is equal to ARR[i], we will check if frequency of ARR[i] . If it is greater than 1 then we will decrease the frequency of ARR[i] by 2 and add a pair (ARR[i] , ARR[i]) to our answer.
  • Else, if the frequency of ARR[i] and Targ...read more
Answered Anonymously
Add your answer

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.

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...read more
View 1 more answer
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 ...read more
Add your answer
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...read more
Add your answer

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...read more
Add your answer
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...read more
Add your answer

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...read more
Add your answer
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...read more
Add your answer

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 ...read more
Add your answer

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...read more
Add your answer
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...read more
Add your answer

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...read more
Add your answer
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...read more
Add your answer

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 ...read more
Add your answer

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...read more
Add your answer
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...read more
Add your answer
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’...read more
Add your answer

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...read more
Add your answer
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...read more
Add your answer

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...read more
Add your answer
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...read more
Add your answer