Update appNew update is available. Click here to update.
Software Engineer
Paytm (One97 Communications Limited)
upvote
share-icon
4 rounds | 10 Coding problems
views
306 views
comment
0 comments
upvote
0 upvotes
Interview preparation journey
expand-icon
Preparation
Duration: 10 months
Topics: Data Structures and Algorithms, OOPS, C programming, C++ Programming, Machine Learning, Operating System, Deep learning.
Tip
Tip

Tip 1 : Practice problems related to data structures and algorithms 
Tip 2 : Brush up fundamental concepts deeply
Tip 3 : You should have a deep knowledge of your projects and related technology.

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

Tip 1 : It should not be more than a page.
Tip 2 : It should be precise and university projects or prior experience like industrial training or internship should be mentioned.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date16 Aug 2020
Problems3

It was held in the evening around 4 pm. The camera was on during the test to invigilate the activity of students. On any doubtful action, warning was given. Platform was easy to code in.

Replace 0s

Given a matrix where every element is either 1 or 0(zero), replace 0 with 1 if surrounded by 1. A 0 (or a set of 0s) is considered to be surrounded by 1 if there ...

view more
Problem approach

I made some syntax errors in this one. Be careful.

Try solving now
Ways To Make Coin Change

You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number ...

view more
Problem approach

This was a greedy problem.
1. Sort the array of coins in decreasing order. Initialize result as empty.
2. Find the largest denomination that is smaller than current amount.
3. Add found denomination to result.
4. Subtract value of found denomination from amount.
5. If amount becomes 0, then print result.
6. Else repeat steps 3 and 4 for new value of V.

Try solving now
Partition a set into two subsets such that the difference of subset sums is minimum.

You are given an array 'arr' containing 'n' non-negative integers.


Your task is to partition this array into t...

view more
Problem approach

The recursive approach is to generate all possible sums from all the values of the array and to check which solution is the most optimal one. 
To generate sums we either include the i’th item in set 1 or don’t include, i.e., include in set 2.
More optimized solution is Dynamic Programming.

Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date18 Aug 2020
Problems4

It was held in the morning around 11:30 am. The interview was scheduled on google meet. The interviewer was quite friendly. He started by a brief introduction. This round was mostly based on Data structures and algorithms. At the end he asked some concepts of OOPs and Operating System.

String Transformation

Given a string (STR) of length N, you have to create a new string by performing the following operation:

Take the smallest character from the first 'K' c...

view more
Problem approach

Solve string questions

Try solving now
Design a stack that supports getMin() in O(1) time and O(1) extra space

Create a stack data structure that allows operations such as push (adding an element), pop (removing the top element), top (retrieving the top element), and also provides a w...

view more
Problem approach

1. Start from brute force approach by using another stack.
2. Optimise it with reducing push and pop operations.
3. Optimise it to O(1) space complexity.

Try solving now
Number of GP sequence

You are given an array containing ‘N’ integers. You need to find the number of subsequences of length 3 which are in Geometric progression with common ratio ‘R’.

view more
Problem approach

1. I started with brute force approach using three loops.
2. I optimized it to two loops by using sorting and two pointer technique.

Try solving now
Operating System

What are the conditions for a deadlock to occur?

Problem approach

Tip 1 : Explain what deadlock is briefly.
Tip 2 : Be confident while answering.
Tip 3 : Explain its conditions in detail. Refer to youtube channel gate smashers for clarity of topic.

03
Round
Medium
Face to Face
Duration45 minutes
Interview date18 Aug 2020
Problems2

It was held in the afternoon around 3pm. The interviewer was quite friendly. She started with my introduction. She asked 2-3 problems related to data structures and then asked about python libraries which I used in my projects.

Group Anagrams

You have been given an array/list of strings 'inputStr'. You are supposed to return the strings as groups of anagrams such that strings belonging to a particular group are anagrams of one an...

view more
Problem approach

I used hash maps to solve the problems.
 

Try solving now
Kth Smallest Element

You are given an array of integers 'ARR' of size 'N' and another integer 'K'.


Your task is to find and return 'K&#...

view more
Problem approach

1. I started with brute force approach of sorting the array and then finding the kth smallest element. This was O(nlogn) approach.
2. Then I solved using heaps with an O(n) approach.

Try solving now
04
Round
Medium
Face to Face
Duration45 minutes
Interview date18 Aug 2020
Problems1

It was held in the evening around 6 pm. The interviewer started with a brief introduction of me. He asked about my projects and then asked some concepts of Operating System and problems related to data structures. I had projects of Machine Learning and Deep learning. Discussion about projects continued for about 25 minutes.

Middle of Linked List

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we ret...

view more
Problem approach

Used hare and tortoise method to solve this problem.

Try solving now
Start a Discussion
Similar interview experiences
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Paytm (One97 Communications Limited)
70 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Paytm (One97 Communications Limited)
33 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Paytm (One97 Communications Limited)
80 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Paytm (One97 Communications Limited)
59 views
0 comments
0 upvotes
Companies with similar interview experiencs
company logo
Software Engineer
3 rounds | 3 problems
Interviewed by Mindtree
7078 views
6 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
4600 views
1 comments
0 upvotes
company logo
Software Engineer
4 rounds | 6 problems
Interviewed by Providence Global Center LLP
4917 views
0 comments
0 upvotes