i
Paytm
Filter interviews by
Clear (1)
I was interviewed in Nov 2021.
Round duration - 45 Minutes
Round difficulty - Easy
The interviewer asked me to introduce myself and asked about my experience in my current company.
Given a linked list of integers, your task is to implement a function that deletes a node at a specified position, 'POS'.
If the specified position is gre...
Implement a function to delete a node at a specified position in a linked list.
Traverse the linked list to find the node at the specified position.
Update the pointers to skip the node to be deleted.
Handle edge cases like deleting the head or tail node.
Return the modified linked list.
Round duration - 45 minutes
Round difficulty - Easy
This was the managerial round.
Sharding is a database partitioning technique to improve performance and scalability by distributing data across multiple servers.
Sharding involves breaking up a database into smaller, more manageable parts called shards.
Each shard contains a subset of the data, allowing for parallel processing and improved performance.
Sharding helps distribute the workload across multiple servers, preventing bottlenecks and improving ...
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements whose NGE is yet to be found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the NGE as the top element of the stack or -1 if the stack is empty.
Tip 1 : If you are applying for a company go through their previous asked questions.
Tip 2 : Be regular while practicing questions from online coding platform
Tip 3 : Need to have a better understanding of everything you mentioned in the resume.
Tip 1 : Keep it short and precise
Tip 2 : Mention in figures like how your contribution improved the existing system
I was interviewed in Nov 2021.
Round duration - 50-60 minutes
Round difficulty - Medium
Timing: 50-60 mins (Second half)
Interviewer was cool and focussed on DSA.
Given a reference to a node in a singly linked list, your task is to delete that node. Every node in the list has a unique value. The head of the linked list will not be pro...
To delete a node in a singly linked list given a reference to the node.
Traverse the linked list to find the node to be deleted.
Update the value of the node to be deleted with the value of the next node.
Point the next pointer of the node to be deleted to the next node's next pointer.
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
The binary tree is represented i...
Print nodes of a binary tree in spiral order traversal.
Use a queue to perform level order traversal.
Alternate between printing nodes from left to right and right to left at each level.
Handle null nodes appropriately.
Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', output should be '1 3 2 4 5'.
Round duration - 60 Minutes
Round difficulty - Medium
Your task is to create a deep copy of a linked list, where each node has two pointers: one that points to the next node in the list, and a 'random' pointer which can ...
Create a deep copy of a linked list with random pointers.
Iterate through the original linked list and create a new node for each node in the list.
Store the mapping of original nodes to their corresponding new nodes in a hashmap.
Iterate through the list again to set the next and random pointers of the new nodes based on the mapping.
Return the head of the newly created deep copied linked list.
Round duration - 60 Minutes
Round difficulty - Medium
Round duration - 60 minutes
Round difficulty - Medium
Basic HR questions
Tip 1 : Prepare the most frequently asked DSA questions first.
Tip 2 : Prepare well your previous and current project.
Tip 3 : Do not rush for HARD questions, Do start with filtering question based on topic and once you are confident in topics pick question company wise.
Tip 1 : ONE PAGE RESUME
Tip 2 : Highlight the project descriptions and skills you are good in.
I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.
Online interview with question on binary search and trees
What people are saying about Paytm
I was interviewed in Aug 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Their were 3 DSA coding questions of medium and hard level. I need to solve them in 70 minutes. Coding questions were of Arrays, Linked list and Binary search trees
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to sort the array in a single pass.
Initialize low, mid, and high pointers at the start, iterate through the array, and swap elements accordingly.
Example: If the current element is 0, swap it with the element at the low pointer and increment both low and mid pointers.
Round duration - 60 Minutes
Round difficulty - Medium
This round was majorly focused on problem solving skills and DSA. Interviewer asked me three DSA questions of medium and hard level. He started with the hard question, he asked me zig-zag binary tree traversal. we discussed the approach than I coded it and explained its Time and space complexity. Than he asked me max sum subarray modified question, I solved it using Kadane algorithm. Than he discussed one of my online assesments question and asked me to further optimize that approach that I used in the online test. Than I optimized that approach and coded that. Than he asked me for any questions and we dropped the call.
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
The binary tree is represented i...
Print nodes of a binary tree in spiral order traversal.
Use a queue to perform level order traversal.
Alternate between printing nodes from left to right and right to left at each level.
Handle null nodes appropriately.
Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
At each index, decide whether to include the current element in the subarray or start a new subarray.
The maximum subarray sum can be calculated using Kadane's algorithm.
Example: For array [34, -50, 42, 14, -5, 86], the maximum sum is 137.
Example: For arr
Round duration - 40 Minutes
Round difficulty - Medium
This round was mainly focused on operating systems, DBMS and past projects. we started with the introduction. Interviewer asked me explain a functionality of one of my projects that I wrote in my resume, I done that than he started asking OS and DBMS questions. After that we asked me about any bad experience in my past internship, I told that than he asked for any questions to me and we dropped the call and after 2 days I got HR mail that I'm selected.
Tip 1 : prepare DSA well
Tip 2 : prepare core subjects well.
Tip 1 : Write internships and projects in detail
Tip 2 : Avoid grammar errors
Paytm interview questions for designations
I was interviewed in Jul 2021.
Round duration - 60 minutes
Round difficulty - Easy
2 DSA problems to be solved in 60 min time limit.
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
Given a list of integers, find the next greater element for each element in the list.
Iterate through the list from right to left and use a stack to keep track of elements.
Pop elements from the stack until a greater element is found or the stack is empty.
Store the next greater element for each element in a result array.
If no greater element is found, store -1 in the result array.
Given a sorted array A
and an integer X
, your task is to find and return the floor value of X
in the array.
The floor value of X
is the largest element in array A
which...
Find the largest element in a sorted array smaller than or equal to a given integer X.
Use binary search to efficiently find the floor value of X in the sorted array.
Compare the middle element of the array with X and adjust the search accordingly.
Return the element before or equal to X as the floor value, or -1 if no such element exists.
Round duration - 60 minutes
Round difficulty - Medium
Face to Face round with interviewer.
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
The task is to find the length of the longest common subsequence between two given strings.
Implement a function to find the longest common subsequence between two strings.
Use dynamic programming to solve this problem efficiently.
Iterate through the strings and build a matrix to store the lengths of common subsequences.
The value in the bottom-right corner of the matrix will be the length of the longest common subsequenc
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
At each index, decide whether to include the current element in the subarray or start a new subarray.
Update the maximum sum if a new maximum is found.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Round duration - 60 minutes
Round difficulty - Medium
Face to Face DSA round.
You are given a singly linked list of integers. The task is to delete the middle node of this list.
1. If the list has no middle node, return an empty list (NU...
Delete the middle node of a singly linked list in O(N) time complexity and O(1) space complexity.
Identify the middle node using slow and fast pointers technique.
Update the pointers to skip the middle node.
Handle edge cases like no middle node or two middle nodes.
Perform the deletion in a single traversal of the linked list.
Return the modified linked list after deletion.
Given an array/list of strings STR_LIST
, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.
Group anagrams together in a list of strings.
Iterate through the list of strings and sort each string to group anagrams together.
Use a hashmap to store the sorted string as key and the original string as value.
Return the values of the hashmap as the grouped anagrams.
Round duration - 60 minutes
Round difficulty - Easy
This round was with VP (technology).
1. One DSA problem.
2. Had a discussion on the projects mentioned in CV.
3. Theory Ques from DBMS, OS.
You are provided with a N x 2 2-D array called Jobs
consisting of N
jobs. In this array, Jobs[i][0]
represents the deadline of the i-th job, while Jobs[i][1]
indicates the...
Maximize profit by scheduling jobs within their deadlines.
Sort the jobs array in descending order of profits.
Iterate through the sorted array and schedule jobs based on deadlines.
Keep track of completed jobs and their profits to calculate the total profit.
Return the maximum profit achieved by scheduling jobs within deadlines.
Tip 1 : Be clear with your Basics
Tip 2 : 20-25 Questions from every DSA topic are enough to crack.
Tip 3 : Be clear with the intuition behind every problem.
Tip 1 : Must have projects in your Resume if there are no internships.
Tip 2 : Do not put false things on resume.
Get interview-ready with Top Paytm Interview Questions
I was interviewed in Feb 2021.
Round duration - 75 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
Given a sequence of 'N' space-separated non-negative integers A[1], A[2], ..., A[i], ..., A[n], where each number in the sequence represents the height of a lin...
Find two lines to form a container with maximum water capacity based on given heights.
Iterate through the array and use two pointers to find the maximum area.
Calculate the area using the formula: min(height[left], height[right]) * (right - left).
Move the pointer with the smaller height towards the center to potentially find a larger area.
Given an N * M grid representing a maze with obstacles, compute and return the total number of distinct paths from the top-left cell to the bottom-right cell. A cell in the...
Find the total number of distinct paths in a maze with obstacles from top-left to bottom-right cell.
Use dynamic programming to keep track of the number of paths to reach each cell.
Handle blocked cells by setting their path count to 0.
Only move right or down from any given cell to calculate the number of paths.
Return the total number of valid paths modulo 10^9 + 7.
Round duration - 100 minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair : Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 10:00 A.M to 12:00 P.M
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...
Find the minimum number of fountains to activate to water the entire garden.
Iterate through the array to find the coverage of each fountain.
Keep track of the farthest coverage reached by each activated fountain.
Activate the fountain that covers the farthest distance not yet covered.
Repeat until the entire garden is watered.
You are provided with a list of 'transactions' involving 'n' friends who owe each other money. Each entry in the list contains information about a receiver, sender, and the tran...
Minimize cash flow among friends by optimizing transactions.
Create a graph where nodes represent friends and edges represent transactions.
Calculate net amount each friend owes or is owed by summing up all transactions.
Use a recursive algorithm to minimize cash flow by settling debts between friends.
Update the graph after each settlement and continue until all debts are settled.
Output the minimized cash flow in a 2-D ma
Round duration - 30 minutes
Round difficulty - Easy
This was a Telephonic Round (Audio Call). The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.
Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : Try practicing medium difficulty level coding questions more.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
I was interviewed in Dec 2020.
Round duration - 60 Minutes
Round difficulty - Easy
You are given an array ARR
of 'N' integers and a positive integer 'K'.
Your task is to determine the lexicographically smallest array that can be obtain...
The task is to determine the lexicographically smallest array that can be obtained by performing at most 'K' swaps of consecutive elements.
Sort the array in non-decreasing order and keep track of the number of swaps made.
Iterate through the array and swap adjacent elements if it results in a lexicographically smaller array.
Continue swapping until the maximum number of swaps 'K' is reached or the array is lexicographica...
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Try solving Love Babbar 450 Prog questions
Tip 2 : Have a good resume
Tip 3 : Do learn some extra technologies eg. ML/AI
Tip 1 : Do not lie at all
Tip 2 : Have some projects listed
I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.
Program to create a spiral array using 2D-array
Create a 2D-array with given dimensions
Initialize variables for row, column, and direction
Fill the array in a spiral pattern by changing direction when necessary
Return the spiral array
I was interviewed before Sep 2020.
Round duration - 70 minutes
Round difficulty - Easy
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++ language.
The questions asked were-
1. Minimum insertions required to make a string palindrome
2. To find the distance of the closest leaf from a node with given data.
3. Add two numbers represented by linked lists
22 students were selected for the next round.
Determine the minimal number of characters needed to insert into a given string STR
to transform it into a palindrome.
STR = "abcaa"
The task is to find the minimum number of characters needed to insert into a given string to make it a palindrome.
Use dynamic programming to find the longest palindromic subsequence of the given string.
Subtract the length of the longest palindromic subsequence from the length of the original string to get the minimum insertions required.
Handle edge cases like an empty string or a string that is already a palindrome.
Exa...
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...
Find the minimum distance from a given node to the nearest leaf node in a binary tree.
Traverse the binary tree from the given node 'X' to find the nearest leaf node using BFS or DFS.
Keep track of the distance from 'X' to each leaf node encountered during traversal.
Return the minimum distance found as the output.
Given two singly linked lists, with each list representing a positive number without leading zeros, your task is to add these two numbers and return the result in the form of a new...
Add two numbers represented by linked lists and return the result as a new linked list.
Traverse both linked lists simultaneously while adding corresponding elements and carry over the sum if needed
Handle cases where one linked list is longer than the other
Create a new linked list to store the sum of the two numbers
Round duration - 80 minutes
Round difficulty - Easy
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 my project and I answered them confidently. After 70-75 mins he said that interview was over and that I may ask him anything. I asked him to give me feedback about my resume and my project. He gave me advice to improve my resume and the interview was over. The first technical interview was easy and was not so challenging as I was prepared.
Given an array of integers ARR
with length 'N' and an integer 'Target', the task is to find all unique pairs of elements that add up to the 'Target'.
First line: Integer...
Find all unique pairs of elements in an array that add up to a given target sum.
Use a hashmap to store the difference between the target sum and each element as keys and their indices as values.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the pairs of elements that add up to the target sum.
Sort the given array of integers in ascending order using the quick sort algorithm. Quick sort is a divide-and-conquer algorithm where a pivot point is chosen to partition the...
Implement quick sort algorithm to sort an array of integers in ascending order.
Choose a pivot element (e.g., rightmost element) to partition the array into two subarrays.
Recursively apply quick sort on the subarrays until the entire array is sorted.
Time complexity can be optimized to NlogN for worst-case scenarios.
Given a sequence of numbers, denoted as ARR
, your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Implement the Merge Sort algorithm which involves dividing the array into two halves, sorting each half, and then merging them back together.
Recursively call the Merge Sort function on each half of the array until the base case of having a single element in the array is reached.
Merge the sorted halves back together in a new array in no...
Round duration - 60 minutes
Round difficulty - Medium
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 to write code for inorder traversal. Obviously, I used a recursive approach. He then asked me to use the iterative method to find inorder traversal of the tree.
The questions he asked were-
1. Inorder traversal (both recursive and iterative method)
2. Level Order Traversal
( For obvious reasons I knew level order traversal very well. I coded it swiftly, so he asked me to write code for Zig-Zag traversal)
Find the inorder successor of a given node in a binary tree. The inorder successor is the node that appears immediately after the given node during an inorder traversal....
Find the inorder successor of a given node in a binary tree.
Perform an inorder traversal of the binary tree to find the successor of the given node.
If the given node has a right child, the successor will be the leftmost node in the right subtree.
If the given node does not have a right child, backtrack to the parent nodes to find the successor.
Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.
In zigzag order, level 1 is printed from left to right...
Implement a function to print the zigzag traversal of a binary tree.
Use a queue to perform level order traversal of the binary tree.
Maintain a flag to switch between printing nodes from left to right and right to left at each level.
Store nodes at each level in a list and reverse the list if the flag is set to print in zigzag order.
Round duration - 50 minutes
Round difficulty - Medium
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 use this tech instead of this, security features, scalability of the project and many more. I answered almost every question as perfectly as I can. Later he asked me some basic questions from NodeJS (as I am a full stack developer). In the end, he asked a puzzle. I didn't know the solution to the puzzle but we discussed it and I figured out the solution.
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
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
I was interviewed before Sep 2020.
Round duration - 70 minutes
Round difficulty - Medium
Timing: 6:00 pm
3 coding questions of medium to be solved in 70 minutes.
Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.
The first line of input contains the size of the arr...
Find the maximum sum of any contiguous subarray in an array of numbers in O(N) time.
Use Kadane's algorithm to find the maximum subarray sum in O(N) time.
Initialize two variables: maxEndingHere and maxSoFar to keep track of the maximum sum.
Iterate through the array and update the variables accordingly.
Return the maxSoFar as the result.
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...
Find the minimum distance from a given node to the nearest leaf node in a binary tree.
Traverse the binary tree from the given node 'X' to find the nearest leaf node.
Use a queue for level order traversal to efficiently find the nearest leaf node.
Calculate the distance from node 'X' to each leaf node and return the minimum distance.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process of oranges.
Track the time taken to rot all fresh oranges and return the result.
If any fresh oranges remain after simulation, return -1 as it is impossible to rot all oranges.
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was friendly, encouraging, and humble.
Given a non-decreasing sorted array ARR
of N
positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...
The task is to find the smallest positive integer value that cannot be represented as a sum of elements of any proper subset of the given array.
The array is sorted in non-decreasing order, so we can iterate through the array and keep track of the maximum sum we can form.
If the current element is greater than the maximum sum + 1, then the maximum sum + 1 is the smallest positive integer that cannot be represented.
If all...
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was not speaking much. It was a bit strange.
Your task is to identify and return the bottom right view of a given binary tree.
This involves viewing the binary tree from an angle of 45 degrees from...
Identify and return the bottom right view of a given binary tree by viewing it from an angle of 45 degrees from the bottom right side.
Traverse the binary tree in a right-to-left manner and keep track of the last node encountered at each level.
Use a queue for level order traversal and update the result array with the last node at each level.
Return the result array sorted in ascending order as the bottom right view of th
Round duration - 30 Minutes
Round difficulty - Easy
Timing: 7:00 pm
The interviewer was friendly and in a bit of a hurry.
Tip 1 : DSA is the key. Starting from scratch, one can become proficients in a couple of months.
Tip 2 : Solve questions just a bit outside your comfort zone. Solve too easy to too hard questions is not of any use.
Tip 3 : Be consistent, make a habit of following good coding practices.
Tip 4 : Get to know the ins and out of your projects. You must be very confident while explaining those.
Tip 5 : Don't just directly to system-design, brush up on OOPS principles, networks, OS, DBMS before that.
Tip 1: Keep it crisp and to the point. Make bullet points.
Tip 2: Bold the things you want to be paid attention to. Use numbers rather than vague sentences.
Tip 3: Only put the things you are confident about.
Tip 4: Don't put things irrelevant to the job, it only dilutes the main content.
Some of the top questions asked at the Paytm Software Developer interview -
The duration of Paytm Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 25 interviews
4 Interview rounds
based on 48 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