Paytm interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Paytm
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
I received the opportunity through on-campus recruitment. I was rejected after the interview. The technical interviews included tree-related questions. The coding round consisted of easy to medium-level questions.
Application story
I received the opportunity through on-campus recruitment. I was rejected after the interview. The technical interviews included tree-related questions. The coding round consisted of easy to medium-level questions.
Why selected/rejected for the role?
Unfortunately, I could not clear the technical round due to the coding questions. But rejection is a part of life; it provides the motivation to achieve success.
Preparation
Duration: 3 months
Topics: Data Structures & Algorithms, Operating System, Object-Oriented Programming System, DBMS, CN
Tip
Tip

Tip 1: Prepare DSA thoroughly, and I personally recommend Coding Ninjas for interview preparation.
Tip 2: Be confident and relaxed during the interview.
Tip 3: Revise your projects, including how they work and what their functionalities are.

Application process
Where: Campus
Eligibility: 8 CGPA, (Salary Package: 7 LPA)
Resume Tip
Resume tip

Tip 1: Keep your resume concise, ideally one page, and mention only the skills you are confident in.
Tip 2: Do not include false information on your resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration65 minutes
Interview date19 Aug 2021
Coding problem3

There were 3 coding questions, and I solved all of them. They were based on arrays, trees, and linked lists.

 

1. Odd and even positioned linked list nodes

Easy
10m average time
90% success
0/40
Asked in companies
AccenturePaytm (One97 Communications Limited)American Express

You are given a singly linked list ‘HEAD’ consisting of ‘N’ nodes. The task is to group all the odd nodes together, followed by the even nodes, maintaining the relative order of nodes given in the input. Note that we are talking about the node’s positions and not the value stored in the node. Try to write an in-place algorithm (i.e., without using any extra space) to solve this problem.

Example:
Given linked list: ‘2 => 1 => 3 => 4 => 6 => 5’

While maintaining the relative order of nodes as it is in the input, Nodes at odd positions are (2, 3, 6), and nodes at evens position are (1, 4, 5).

Modified linked list: ‘2 => 3 => 6 => 1 => 4 => 5’
Note:
1. Consider that the first node is odd, the second is even, and so on.
Problem approach

By using ODD, EVEN pointers.

Try solving now

2. Maximum In Sliding Windows Of Size K

Moderate
20m average time
80% success
0/80
Asked in companies
AppleGoogleWalmart

Given an array/list of integers of length ‘N’, there is a sliding window of size ‘K’ which moves from the beginning of the array, to the very end. You can only see the ‘K’ numbers in a particular window at a time. For each of the 'N'-'K'+1 different windows thus formed, you are supposed to return the maximum element in each of them, from the given array/list.

Problem approach

by using sliding window.

Try solving now

3. Maximum Depth Of A Binary Tree

Easy
15m average time
85% success
0/40
Asked in companies
FacebookTata Consultancy Services (TCS)Walmart

You are given the root node of a binary tree with N nodes, whose nodes have integer values. Your task is to find the maximum depth of the given Binary tree.

Depth of a binary tree is the same as its height. In simpler terms, you have to find the total number of nodes encountered while moving from the root node to the farthest leaf node, along the longest path of the binary tree.

Example:-

example

If we are given the above binary tree as input then moving from root node(5) to the farthest leaf node(50), the path formed will be [ 5->10->25->35->40->45->50 ]. The total number of nodes encountered is 7, therefore the maximum depth of the binary tree is 7.
Problem approach

Using BFS, I was able to solve this problem.

Try solving now
02
Round
Hard
Video Call
Duration60 minutes
Interview date23 Aug 2021
Coding problem1

The interviewer asked some OOPS concepts and tree-related questions.

1. Time To Burn Tree

Hard
50m average time
50% success
0/120
Asked in companies
SprinklrShareChatZomato

You have a binary tree of 'N' unique nodes and a Start node from where the tree will start to burn. Given that the Start node will always exist in the tree, your task is to print the time (in minutes) that it will take to burn the whole tree.


It is given that it takes 1 minute for the fire to travel from the burning node to its adjacent node and burn down the adjacent node.


For Example :
For the given binary tree: [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
Start Node: 3

    1
   / \
  2   3
     / \
    4   5

Output: 2

Explanation :
In the zeroth minute, Node 3 will start to burn.

After one minute, Nodes (1, 4, 5) that are adjacent to 3 will burn completely.

After two minutes, the only remaining Node 2 will be burnt and there will be no nodes remaining in the binary tree. 

So, the whole tree will burn in 2 minutes.
Problem approach

Not able to solve

Try solving now

Here's your problem of the day

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

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
1632 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
1100 views
0 comments
0 upvotes
company logo
System Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
878 views
0 comments
0 upvotes
company logo
Software Engineer Intern
3 rounds | 6 problems
Interviewed by Paytm
84 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
107832 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
52129 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32261 views
6 comments
0 upvotes