Paytm Interview Experience for Fresher SDE - 1, Aug 2020

Posted: 21 Dec 2020
Jump to Interview Rounds


Kunal Khandelwal
Computer Science Engineering
7.8 CGPA


4 months
Data Structures, OOPS, Dynamic Programming, Recursion, Advanced Data Structures, Operating System, Time complexity analysis and Sorting Algorithms
Preparation Tip

Tip 1 : Properly grasp Data Structures and Algorithms from basics.
Tip 2 : Learn about Time complexity 
Tip 3 : Be honest and walk through your thought process to the interviewer.
Tip 4 : Its always good to be presentable and have good communications skills

Application Process

above 7 CGPA, No active backlogs
Resume Tip

Tip 1 : Never Lie on your resume. Only write what you have done and what you know.
Tip 2 : It's good to have one or two projects on your resume. Mention the tech stack you used and a brief description of the project. It will be best if you host/upload your project on the cloud.
Tip 3 : Avoid unnecessary details like Hobbies, family details, declaration, date, signature, etc.
Tip 4 : You're more than a 1-page resume. But your resume should not be more than a page

Interview Process

Round 1

70 minutes
Round Type:
Online Coding Interview
17 Aug 2020

The first round was the Online Coding Round of 70 minutes with 3 problems of 3 marks, 3 marks, and 4 marks respectively.
The first two questions were easy and the third one was a bit tricky. The round started at 6 PM. 
Anyone who is practicing continuously could have solved these questions easily within the time limit. The test cases were also not so hard and distinct. I coded in C++...

View more
Minimum insertions to make a string palindrome

A palindrome string is one that reads the same backward as well as forward. Given a string STR, you need to tell the minimum number of characters needed to insert into it to make it a palind...

View more
Try Problem
See my Approach
Closest Leaf To Given Node In Binary Tree

Ninja is stuck in a maze which is in a form of a binary tree. He needs your help in order to get out.

View more
Try Problem
See my Approach
Add two linked lists

You have been given two singly Linked Lists, where each of them represents a positive number without any leading zeros.

Your task is to add these two numbers and print...

View more
Try Problem
See my Approach

It was a technical interview. The platform used was google meet for online video calling. The interviewer first introduced himself then asked me to introduce myself. He also asked about my well-being amid the Covid-19 pandemic. He asked me 3 problems from data structures. He put a lot of focus on my project. We discussed about my project for about 20 mins. He asked various questions related to ...

View more
Two Sum

You are 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 Target.

Note: We cannot use ...

View more
Try Problem
See my Approach
Quick Sort

You are given an array of integers. You need to sort the array in ascending order using quick sort.

View more
Try Problem
See my Approach
Merge Sort

Given a sequence of numbers ‘arr’. Your task is to return a sorted sequence of ‘arr’ in non-descending order with help of the merge sort algorithm.


Merge Sort Algorithm -

Merge sort is a Divide and Co...
View more
Try Problem
See my Approach

This was also a technical round. The interviewer focused on data structures and resume. Apart from some basic questions about my resume, he asked majorly about data structures and algorithms. The interview was an hour long and he asked only 2 problems. Both of them were from trees. In this round, he focused if I can change my approach if a slight change is made in the question. Like he asked me...

View more
Inorder Sucessor

Given an arbitrary binary tree and a node of this tree, you need to find the inorder successor of this node in the tree.

View more
Try Problem
See my Approach
zig zag traversal

You have been given a Binary Tree of “N” nodes, where the nodes have integer values. Your task is to print the zigzag traversal of the given tree.

In zigzag order, level 1 is printed from left to right fash...
View more
Try Problem
See my Approach

This was the final round of the Interview process. My interview was scheduled for 7.30 PM. It started at approximately 7.40 PM. The main focus of the interviewer was on my projects and my skills. He asked me many questions regarding my project like what problems I faced, what did you learn from this, apart from developing skills what else did you learn while developing the project, why did you ...

View more
Camel and banana puzzle

A person has 3000 bananas and a camel. He wants to transport the maximum number of bananas to a destination 1000 KMs away, using only the camel as a mode of transportation. The camel cannot carry more than 1000 bananas at a time and eats a banana every km it travels. What is the maximum number of bananas that can be transferred to the destination using only camel (no other mode of transportatio...

View more
See my Approach
Have an interview experience that you want to contribute?


Want to Join the discussion?