'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Paytm (One97 Communications Limited) interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Paytm (One97 Communications Limited)
upvote
share-icon
4 rounds | 9 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 8 months
Topics: Data Structures, Algorithms, OOPS, Operating Systems, DBMS, Dynamic Programming, Tree, Linked List, Low level Design
Tip
Tip

Tip 1 :  Practice atleast 100-150 Medium problems and 20-30 hard problems from leetcode
Tip 2 : Try to give a short contest maybe on leetcode, codeforces or codechef as it is beneficial to crack in Online Test.
Tip 3 : Do atleast 2 projects and ask find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you an modification in your project.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Try to keep a single page resume.
Tip 4 : If your CGPA is quite low do not mention it on the resume.
Tip 5 : In achievements sections only add relevant achievements. Putting achievements like "won painting competition" or "won dancing competition" wont help.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration70 minutes
Interview date29 Oct 2020
Coding problem3
1. Coding Problem

We were given a number system where 0 was mapped to 9, 1 to 8, 2 to 7, 3 to 6 and so on.We were given an positive integer as an input and we had to convert it into an integer in the new number system.

Problem approach

1)Relationship for any digit x its value in new number system was 9 - x
2)Converted integer to string
3)Manipulated every index of this string using the relationship.
4)Converted this string to number and returned the answer.

2. Subtree of Another Tree
Easy
10m average time
90% success
0/40
Asked in companies
Thought WorksInfo Edge India (Naukri.com)GE (General Electric)

Given two binary trees T and S, check whether tree S has exactly the same structure and node values with a subtree of T, i.e., check if tree S is a subtree of the tree T.

View more
Problem approach

For each node during pre-order traversal of s, use a recursive function isSame to validate if sub-tree started with this node is the same with t.

Try solving now
3. Binary strings with no consecutive 1s.
Moderate
25m average time
65% success
0/80
Asked in companies
Wells FargoSwiggyGoogle

You have been given an integer 'N'. Your task is to generate and return all binary strings of length 'N' such that there are no consecutive 1's in the string.


View more
Problem approach

You can easily observe pattern. It is a Fibonacci sequence 

Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date2 Nov 2020
Coding problem2

This was a data structures round.

1. Longest Consecutive Sequence
Moderate
40m average time
70% success
0/80
Asked in companies
WalmartGoldman SachsInfosys

You are given an unsorted array/list 'ARR' of 'N' integers. Your task is to return the length of the longest consecutive sequence.

View more
Problem approach

I thought of two points on a number line a and b and formulated a consecutive sequence [a....b], (b*(b+1))/2-(a*(a+1))/2=n. Now we have a clearly quadratic solution by brute-forcing a and b but if we simplify it further we have (b-a+1)*(b+a) = 2*n. So now we can easily find all divisors of 2*n and satisfy the equation for which we get a>=0 and b>=0 and thus we get the answer.

Try solving now
2. Permutations
Moderate
10m average time
90% success
0/80
Asked in companies
InfosysFlipkartTata Consultancy Services (TCS)

A permutation is a mathematical technique that determines the number of possible arrangements in a set when the order of the arrangements matters. A string of length 'N' has 'N'! permutati...

View more
Problem approach

I knew the recursive solution as it is a very popular interview problem.The idea is much like the insertion sort. We start with only the first number, and pick next number from the rest of array, insert it to the front or back position of the first number, and pick the third number, insert it to front or mid or back position of the [first, second] array, and so on, until no element left.

Try solving now
03
Round
Easy
Face to Face
Duration60 minutes
Interview date2 Nov 2020
Coding problem2

This was a data structures round.

1. Is SubSequence
Easy
10m average time
90% success
0/40
Asked in companies
Paytm (One97 Communications Limited)Quadrical AIRootstock Software

You have been given two strings ‘STR1’ and ‘STR2’.

Your task is to find if ‘STR1’ is a subsequence of ‘STR2’.

View more
Problem approach

Easy problem iterate over the longer string and keep a counter for matching it with shorter string if a match occurs while iterating longer string increment the counter and if we have done iterating on the longer string if the counter value is equal to shorter string length then return true else return false.

Try solving now
2. Minimum falling path sum
Moderate
25m average time
65% success
0/80
Asked in companies
VisaPaytm (One97 Communications Limited)

You have been given a square array 'VEC' of integers of size 'N' rows and 'N' columns. Your task is to find the minimum sum of a falling pat...

View more
Problem approach

It was also an easy problem as I had done it before.The minimum path to get to element A[i][j] is the minimum of A[i - 1][j - 1], A[i - 1][j] and A[i - 1][j + 1]. Starting from row 1, we add the minimum path to each element. The smallest number in the last row is the minimum path sum.

Try solving now
04
Round
Easy
Face to Face
Duration25 minutes
Interview date2 Nov 2020
Coding problem2

This round was all about OS/DBMS questions.

1. Operating Systems

Three questions were asked: -

1. What is Virtual Memory?
2. What is Belady's Anomaly?
3. What is page fault?

Problem approach

Watch Sanchit Jain videos for OS

2. DBMS

Find nth maximum salary from employee table. Schema of the table is: -

 (employee_id,employee_name,employee_salary)

Problem approach

Study SQL and practice SQL queries.

Start a Discussion
Similar interview experiences
company logo
Software Engineer
4 rounds | 8 problems
Interviewed by Paytm (One97 Communications Limited)
182 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 8 problems
Interviewed by Paytm (One97 Communications Limited)
398 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 7 problems
Interviewed by Paytm (One97 Communications Limited)
324 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 6 problems
Interviewed by Paytm (One97 Communications Limited)
191 views
1 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
8632 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
5561 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
5323 views
1 comments
0 upvotes