Paytm Software Engineer Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Minimum Number of Coins Problem
Dora, on her visit to India, decides to enjoy Indian cuisine where payments are accepted only in specific denominations. Your task is to help Dora obtain the minimum number...read more
Ans. Dynamic Programming
We can use dynamic programming to solve this problem. 
 
We maintain a vector ‘dp’ of size AMOUNT+1 and initialize it to a maximum value (say AMOUNT + 1). Here, dp[i] stores the minimum number of coins needed to change an amount ‘i’. 
 
Algorithm
 
• We set dp[0] to 0 as minimum coins to change an amount of ‘0’ is 0.
• We then traverse denominations from beginning to end (loop variable ...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Asked three coding questions and CS fundamentals

Q1. 
Min Stack Problem Statement
Design a special stack that supports the following operations in constant time:
1. Push(num): Insert the given number into the stack.
2. Pop: Remove and return the top element ...read more
Ans. 
1. Used another stack to keep a minimum while pushing and popping the element.
2. Minimised the stack space
3. Optimised approach- Use O(1) approach
Answered Anonymously
Add your answer
Q2. 
Number In Arithmetic Progression Problem
Given three integers X, C, and Y, where X is the first term of an arithmetic sequence with a common difference of C, determine if Y is part of this arithmetic sequ...read more
Ans. Mathematics Based Approach
This is a mathematics question, hence we need to observe a few things and then make cases accordingly to reach our answer.
 
• Case 1: If C = 0 and X = Y
If the common difference is 0 and both X and Y are equal, this implies that Y is the part of the sequence so we print “True”. 
 
• Case 2: If X > Y and C > 0, or X < Y and C <0
If you observe carefully, you’ll see that if we ...read more
Answered Anonymously
Add your answer
Q3. 
Decode String Problem Statement
Your task is to decode a given encoded string back to its original form.
Explanation:
An encoded string format is <count>[encoded_string], where the 'encoded_string...read more
Ans. Stack Solution
The idea is to maintain two Stacks. One will store the integers i.e. number of times the current string is repeated and the other one will store the strings itself. 
We use a simple idea and always evaluate the innermost brackets first. We traverse through our encoded string
• If we encounter an integer, we push it onto our ‘integerStack’.
• If we encounter a character, then we simply append it to the ‘curr...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Coding questions and questions related to my project

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. Count Characters
Anagrams have a unique property: the counts of each distinct character present in both strings are the same. One way to check this is: 
1. Sort both strings, so that all the same characters come together
2. Then loop through both strings together and check each element in both strings one by one
3. If at any position, the characters are found to be different or if the lengths of the two strings are different, ...read more
Answered Anonymously
Add your answer
Q2. 
Kth Smallest Element Problem Statement
You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...read more
Ans. Brute Force
1. Sort the elements of ‘ARR’ using function ‘SORT’
2. Return element at ('K' - 1)th index
Space Complexity: O(1)Explanation:
O(1).
 
Since we are not using any extra space.
Time Complexity: O(nlogn)Explanation:
O(N * logN) where ‘N’ is the number of elements in the array.
 
As we are sorting the array which takes O(N * log(N)) time.
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Coding question and project discussion

Q1. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
Used slow and fast pointer technique
Answered Anonymously
Add your answer
Q2. Can you discuss the projects you have worked on?
Add your answer

One easy and one medium level question was asked

Q1. 2 coding question was asked both on array medium level difficulty and computer science fundamentals and oops concept.
Add your answer

Q1. One coding question on array and others managerial question
Add your answer

Q1. Normal HR Question
Add your answer

Q1. Easy to medium-level array question
Add your answer
Q2. Easy to medium-level matrix question
Add your answer

Q1. Discussion on my project
Add your answer

Q1. Multithreading, oops concepts
Add your answer

Q1. Sorting algorithm, tree and graph
Add your answer

Q1. Puzzles, different types of scenarios based questions
Add your answer

Q1. Salary expectations, ready to relocate, what are the things you do in daily life
Ans. 
I am open to discussing salary expectations and willing to relocate for the right opportunity. In my daily life, I engage in various activities such as coding, learning new technologies, and staying updated with industry trends.
• Open to discussing salary expectations

• Willing to relocate for the right opportunity

• Engage in coding and programming activities

• Constantly learning new technologies

• Staying updated with industry tr
Answered by AI
Add your answer

2 -3 easy/medium questions

Q1. 1) DS Algo questions
Add your answer
Q2. 2) java and springboot basic questions
Add your answer

Q1. 1) DS Algo Questions
Add your answer
Q2. 2) Questions on java , solid principles deisgn patterns
Add your answer