Paytm Software Engineer Interview Questions, Process, and Tips

2 Leetcode easy to medium questions

Q1. Array based question
Add your answer

Q1. Data Structures medium level questions
Add your answer

Q1. Basic Technical and Behavioural Questions
Add your answer

Duration : 1 Hr
No. of Questions : 3
Topics : Array, Greedy

Q1. Heap Related Question
Add your answer
Q2. Convert BST in range
Ans. 
Convert a Binary Search Tree (BST) into a new BST containing only nodes within a given range.
• Perform inorder traversal of the original BST and only add nodes within the given range to the new BST.

• Recursively call the function on left and right subtrees while checking the node values against the range.

• Adjust the pointers of the nodes to form the new BST.
Answered by AI
Add your answer

Q1. What you like in cricket. Give 3 reasons.
Ans. 
I enjoy cricket for its strategic gameplay, team dynamics, and thrilling moments.
• Strategic gameplay - I appreciate the tactics involved in setting up field placements, bowling strategies, and batting techniques.

• Team dynamics - I love how cricket fosters teamwork, communication, and camaraderie among players.

• Thrilling moments - Whether it's a close finish, a spectacular catch, or a big six, cricket always keeps me on th
Answered by AI
Add your answer
Q2. What are you planning for your future like studies and all.
Ans. 
I plan to pursue further studies in computer science and specialize in artificial intelligence.
• Considering pursuing a Master's degree in Computer Science with a focus on AI

• Attending workshops and conferences to stay updated on latest advancements in AI

• Exploring online courses and certifications in machine learning and deep learning
Answered by AI
Add your answer

Python, SQL related questions

Q1. SQL, Python related
Add your answer
Q2. Spark internals
Add your answer

Q1. SQL, Python related
Add your answer
Q2. Spark internals
Add your answer

Q1. General managerial questions
Add your answer

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. 
Find the minimum number of coins needed to make up a given amount using specific denominations.
• Iterate through the available denominations in descending order

• For each denomination, calculate the maximum number of coins that can be used

• Subtract the total value of coins used from the amount until amount becomes 0
Answered by AI
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. 
Design a special stack supporting constant time operations like push, pop, top, and getMin.
• Implement a stack using an additional stack to keep track of the minimum element.

• Use two stacks - one to store elements and another to store minimum values.

• Ensure constant time complexity for all operations by maintaining the minimum value at the top of the min stack.

• Example: Push(1), Push(2), getMin() should return 1.
Answered by AI
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. 
Determine if a given number is part of an arithmetic sequence with a specified first term and common difference.
• Calculate the arithmetic sequence based on the given first term and common difference.

• Check if the given number is part of the calculated sequence.

• Return 'True' if the number belongs to the sequence, otherwise return 'False'.
Answered by AI
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. 
Decode a given encoded string back to its original form by repeating the encoded string 'count' times.
• Parse the input string to extract the count and the encoded string within the brackets

• Use recursion to decode the encoded string by repeating it 'count' times

• Handle nested brackets by recursively decoding the inner strings first
Answered by AI
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. 
Determine if two strings are anagrams of each other by checking if they have the same characters in different order.
• Create a frequency map of characters for both strings and compare them.

• Sort both strings and compare if they are equal.

• Use a hash table to store character counts and check if they are the same for both strings.
Answered by AI
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. 
Find the K-th smallest element in a given array of distinct integers.
• Sort the array in ascending order.

• Return the element at index K-1 from the sorted array.

• Handle edge cases like K being out of bounds or array being empty.
Answered by AI
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. 
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.
Answered by AI
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