Paytm (One97 Communications Limited) interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Paytm (One97 Communications Limited)
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: Data Structures, OOPS, Algorithms, C++, Development
Tip
Tip

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

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

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

Interview rounds

01
Round
Medium
Video Call
Duration45 minutes
Interview date10 Dec 2020
Coding problem2

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

1. Diagonal Traversal of a binary tree.

Easy
10m average time
90% success
0/40
Asked in companies
Paytm (One97 Communications Limited)AmazonSalesforce

You have been given a binary tree of integers. You are supposed to find the diagonal traversal(refer to Example) of the given binary tree.

Example:

Consider lines at an angle of 135 degrees(with respect to standard X- axis)  in between nodes. Then, all nodes between two consecutive lines belong to the same diagonal

alt text

The diagonal traversal for the above tree is: 

0 2 6 1 5 3 4 7 
Try solving now

2. Diameter Of Binary Tree

Easy
10m average time
90% success
0/40
Asked in companies
AdobeSnapdealPhone Pe

You are given a Binary Tree.


Return the length of the diameter of the tree.


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

The number of edges between two nodes represents the length of the path between them.
Example :
Input: Consider the given binary tree:

Example

Output: 6

Explanation:
Nodes in the diameter are highlighted. The length of the diameter, i.e., the path length, is 6.


Try solving now
02
Round
Medium
Video Call
Duration45 Minutes
Interview date10 Dec 2020
Coding problem2

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.

1. Next Greater Element

Easy
10m average time
90% success
0/40
Asked in companies
IBMInfo Edge India (Naukri.com)Amazon

You are given an array 'a' of size 'n'.



The Next Greater Element for an element 'x' is the first element on the right side of 'x' in the array, which is greater than 'x'.


If no greater elements exist to the right of 'x', consider the next greater element as -1.


For example:
Input: 'a' = [7, 12, 1, 20]

Output: NGE = [12, 20, 20, -1]

Explanation: For the given array,

- The next greater element for 7 is 12.

- The next greater element for 12 is 20. 

- The next greater element for 1 is 20. 

- There is no greater element for 20 on the right side. So we consider NGE as -1.
Try solving now

2. Subset Sum Equal To K

Moderate
30m average time
65% success
0/80
Asked in companies
Paytm (One97 Communications Limited)SalesforceAtlassian

You are given an array/list ‘ARR’ of ‘N’ positive integers and an integer ‘K’. Your task is to check if there exists a subset in ‘ARR’ with a sum equal to ‘K’.

Note: Return true if there exists a subset with sum equal to ‘K’. Otherwise, return false.

For Example :
If ‘ARR’ is {1,2,3,4} and ‘K’ = 4, then there exists 2 subsets with sum = 4. These are {1,3} and {4}. Hence, return true.
Try solving now
03
Round
Medium
Video Call
Duration45 Minutes
Interview date10 Dec 2020
Coding problem3

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.

1. Buy and Sell Stock

Hard
0/120
Asked in companies
ZomatoInfo Edge India (Naukri.com)Expedia Group

You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘n’ days.


You are given an array ‘prices’ which such that ‘prices[i]’ denotes the price of the stock on the ith day.


You don't want to do more than 2 transactions. Find the maximum profit that you can earn from these transactions.


Note

1. Buying a stock and then selling it is called one transaction.

2. You are not allowed to do multiple transactions at the same time. This means you have to sell the stock before buying it again. 
Example:
Input: ‘n’ = 7, ‘prices’ = [3, 3, 5, 0, 3, 1, 4].

Output: 6

Explanation: 
The maximum profit can be earned by:
Transaction 1: Buying the stock on day 4 (price 0) and then selling it on day 5 (price 3). 
Transaction 2: Buying the stock on day 6 (price 1) and then selling it on day 6 (price 4).
Total profit earned will be (3 - 0) + ( 4 - 1) = 6. 
Try solving now

2. DBMS Questions

SQL command
ACID properties
Difference between unique primary and foreign key.

3. OS Questions

What is segementation.
Difference between internal and external fragmentation.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you create a function in JavaScript?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Paytm (One97 Communications Limited)
422 views
0 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 10 problems
Interviewed by Paytm (One97 Communications Limited)
573 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 7 problems
Interviewed by Paytm (One97 Communications Limited)
1378 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Paytm (One97 Communications Limited)
445 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13595 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
12782 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
9049 views
2 comments
0 upvotes