Paytm Software Developer Interview Questions, Process, and Tips

Questions related to DP and graph were asked

Q1. Tell me about yourself
Add your answer
Q2. Shortest path in a graph
Add your answer

Coin change problem was asked

Q1. Why join Paytm??
Add your answer
Q2. What do you think about future of Fintech in India
Add your answer

Q1. Vertical order traversal
Add your answer
Q2. Redis based questions
Add your answer

Distance between two Points in xy plain
Concurrent hashmap internal working
Treemap vs Multivalue map

3 questions on Hackerrank

Q1. Recursion Leetcode Medium question
Add your answer
Q2. Tree Leetcode Medium - Hard Question
Add your answer

Q1. DP medium question
Add your answer
Q2. Tree Medium Question
Add your answer

2 Questions based on DS and Algo basic problem solving.

Q1. How many times a boat has to make rounds to travel a number of people from one to another.
Add your answer

Q1. Types of DS and a real life scenario.
Ans. 
Types of DS and a real life scenario
• Arrays - storing a list of names

• Linked Lists - managing a playlist

• Stacks - undo/redo functionality in text editors

• Queues - managing customer requests in a call center

• Trees - organizing files in a computer

• Graphs - social network connections
Answered by AI
Add your answer

Q1. Salary DIscussion on what is current and expected.
Add your answer

The coding round consisted of three questions on arrays, linked lists and trees. It was 70 minutes long.

Q1. The interviewer asked me to introduce myself and then started off by asking me a question on graphs, sorting algorithms and my skills from the resume. Make sure you have thorough knowledge about your resum...read more
Add your answer
Q2. Given a graph, print all the connected components in it.
Ans. 
Print all the connected components in a given graph.
• Traverse the graph using DFS or BFS algorithm.

• Maintain a visited array to keep track of visited nodes.

• For each unvisited node, perform DFS or BFS and add all visited nodes to a connected component.

• Repeat until all nodes are visited.

• Print all connected components.
Answered by AI
Add your answer

Q1. The interviewer asked me questions from my resume on projects mentioned, my skills. Make sure your resume has precise.
Add your answer
Q2. Tell me something that's not on your resume.
Ans. 
I have experience working with agile development methodologies.
• I have worked in Scrum teams and participated in daily stand-up meetings.

• I am familiar with the concept of user stories and have written them for software projects.

• I have experience working in sprints and delivering incremental software updates.

• I have used tools like Jira and Trello for project management in an agile environment.
Answered by AI
Add your answer

Q1. Tell me about yourself.
Ans. 
I am a software developer with experience in various programming languages and a passion for creating innovative solutions.
• Experienced in Java, C++, and Python

• Developed a mobile app using React Native

• Worked on a team to create a web application using AngularJS

• Strong problem-solving and analytical skills
Answered by AI
Add your answer
Q2. What is your family background?
Ans. 
My family background is diverse and includes individuals from various professions and cultural backgrounds.
• My father is a doctor and my mother is a teacher.

• I have two siblings, one is an engineer and the other is a lawyer.

• We have relatives who are artists, entrepreneurs, and scientists.

• Our family gatherings are always filled with interesting conversations and different perspectives.
Answered by AI
Add your answer
Q3. Why should we hire you?
Ans. 
I have a strong technical background and a passion for software development.
• I have a solid understanding of programming languages and frameworks.

• I have experience in developing and maintaining software applications.

• I am a quick learner and adapt well to new technologies.

• I am a team player and work well in collaborative environments.

• I have excellent problem-solving and analytical skills.

• I am dedicated and committed to d...read more
Answered by AI
Add your answer
Q4. What are your strengths and weaknesses?
Ans. 
My strengths include problem-solving, attention to detail, and teamwork. My weaknesses include time management and public speaking.
• Strengths: problem-solving, attention to detail, teamwork

• Weaknesses: time management, public speaking
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

The interviewer asked me to introduce myself and asked about my experience in my current company.

Q1. LCA - Lowest Common Ancestor
Given a binary tree (not a binary search tree) and two values say n1 and n2, write a program to find the least common ancestor.
Ans. 
Following is a simple O(n) algorithm to find LCA of n1 and n2. 
1) Find a path from the root to n1 and store it in a vector or array. 
2) Find a path from the root to n2 and store it in another vector or array. 
3) Traverse both paths till the values in arrays are the same. Return the common element just before the mismatch.
Answered by CodingNinjas
View 2 more amswers
Q2. Delete a Node from Linked List
You have been given a linked list of integers. Your task is to write a function that deletes a node from a given position, 'POS'.
Note :
Assume that the Indexing fo...read more
Ans. 
To delete a node from the linked list, we need to do the following steps. 
1) Find the previous node of the node to be deleted. 
2) Change the next of the previous node. 
3) Free memory for the node to be deleted.
Answered by CodingNinjas
View 2 more amswers

Round duration - 45 minutes
Round difficulty - Easy

This was the managerial round.

Q1. DBMS Question
What is sharding?
Ans. 
Tip 1:Sharding is a very important concept which helps the system to keep data into different resources according to the sharding process.
Tip 2:Sharding makes the Database smaller
Sharding makes the Database faster
Sharding makes the Database much more easily manageable
Sharding can be a complex operation sometimes
Sharding reduces the transaction cost of the Database
Answered by CodingNinjas
Add your answer
Q2. Next Greater Element
For a given array/list of integers of size N, print the Next Greater Element(NGE) for every element. The Next Greater Element for an element X is the first element on the right side of...read more
Ans. 
Step 1:- Push the first element to stack.
Step 2:- Pick rest of the elements one by one and follow the following steps in loop. 
Mark the current element as next.
If stack is not empty, compare top element of stack with next.
If next is greater than the top element, Pop element from stack. next is the next greater element for the popped element.
Keep popping from the stack while the popped element is smaller than next....read more
Answered by CodingNinjas
View 2 more amswers