i
Paytm
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
3 questions were asked that were easy to medium related to array, linked list and string
HashMap is a data structure that stores key-value pairs and uses hashing to quickly retrieve values based on keys.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.
If multiple keys hash to the same index, a collision occurs and the key-value pairs are stored in a linked list at that inde...
Use Floyd's Tortoise and Hare algorithm to detect cycle in a linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If they meet at any point, there is a cycle in the linked list.
Interviewer asked for the upi design
I applied via Campus Placement and was interviewed before Jun 2023. There were 3 interview rounds.
Online assement was on a platform which I don't remember at the moment
But it had 3 basic questions around DSA , try to write quality code as much as possible as questions were easy and doable by everyone
To check if a binary tree is a BST, we can perform an in-order traversal and ensure that the elements are in sorted order.
Perform an in-order traversal of the binary tree
Check if the elements are in sorted order
If any element is not in sorted order, then the tree is not a BST
Merge sort using linked list is a sorting algorithm that divides the list into smaller sublists, sorts them, and then merges them back together.
Create a function to merge two sorted linked lists
Divide the linked list into two halves using slow and fast pointers
Recursively sort the two halves
Merge the sorted halves back together
I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.
Question on double linked list , Red and black tree
What people are saying about Paytm
I applied via LinkedIn and was interviewed before Sep 2023. There were 3 interview rounds.
Puzzles and DSA and OOPS concepts
Data Structures and Algorithms
Data Structures and Algorithms, OOPS
Paytm interview questions for designations
I applied via Referral and was interviewed before Jun 2023. There were 4 interview rounds.
2 Leetcode easy to medium questions
Get interview-ready with Top Paytm Interview Questions
I applied via Campus Placement and was interviewed before Jul 2023. There were 3 interview rounds.
Duration : 1 Hr
No. of Questions : 3
Topics : Array, Greedy
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.
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
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
I applied via Naukri.com and was interviewed before Apr 2023. There were 4 interview rounds.
Python, SQL related questions
I was interviewed in Apr 2022.
Round duration - 60 Minutes
Round difficulty - Medium
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...
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
Round duration - 60 Minutes
Round difficulty - Medium
Asked three coding questions and CS fundamentals
Design a special stack that supports the following operations in constant time:
Push(num)
: Insert the given number into the stack.Pop
: Remove and return the top element ...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.
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...
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'.
Your task is to decode a given encoded string back to its original form.
An encoded string format is <count>[encoded_string], where the 'encoded_string...
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
Round duration - 60 Minutes
Round difficulty - Easy
Coding questions and questions related to my project
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...
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.
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...
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.
Round duration - 60 Minutes
Round difficulty - Easy
Coding question and project discussion
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.
A...
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.
Tip 1 : Focus more on problem solving skills (DSA and CP questions)
Tip 2 : Keep your fundamentals crystal clear
Tip 3 : Read interview experiences on different platforms
Tip 1 : Keep it limited to one page only.
Tip 2 : Do not put false things on resume. Put only the projects on which you have worked.
I applied via Campus Placement and was interviewed before Mar 2023. There were 4 interview rounds.
One easy and one medium level question was asked
I applied via Approached by Company and was interviewed before Mar 2023. There were 2 interview rounds.
Some of the top questions asked at the Paytm Software Engineer interview -
The duration of Paytm Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 40 interviews
4 Interview rounds
based on 178 reviews
Rating in categories
Team Lead
2.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
974
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
915
salaries
| ₹0 L/yr - ₹0 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik