Filter interviews by
Maths,quant for 1 hour duration
Arrays, strings, linked list, palindrome
I applied via Approached by company and was interviewed in Dec 2021. There were 4 interview rounds.
2 questions. 1 was basic level. 2 was of medium level.
Find the largest island in a binary matrix using O(1) space complexity.
An island is defined as a group of connected 1s in the matrix.
Use Depth-First Search (DFS) to explore the matrix and count the size of each island.
Mark visited cells by changing 1s to 0s to avoid using extra space.
Example: For matrix [[0,1,0],[1,1,0],[0,0,1]], the largest island size is 3.
Iterate through each cell, and for each unvisited 1, initiate...
Find the maximum sum path from root to leaf in an N-ary tree using O(n) time and O(1) space.
Define an N-ary tree node structure with a value and a list of children.
Use a depth-first search (DFS) approach to traverse the tree.
Keep track of the maximum sum encountered during the traversal.
Example: For a tree with root 1, children [2, 3], and leaf nodes [4, 5], the max path is 1 -> 3 -> 5.
Find first missing positive number in an array in O(n) time and O(1) space.
Traverse the array and mark the presence of each positive integer by changing the sign of the corresponding index.
Traverse the array again and return the index of the first positive integer.
If all integers are present, return the length of the array + 1.
Example: [3, 4, -1, 1] => mark 3rd and 4th index as negative => return 2.
Example: [1, 2, 0] =...
Given an integer, print the relevant column name in an excel sheet.
Create a string array of alphabets from A to Z
Use modulo operator to get remainder and divide by 26 to get quotient
Append the corresponding alphabet to the result string
Reverse the result string
Top trending discussions
I applied via LinkedIn and was interviewed in Apr 2023. There were 3 interview rounds.
Exam to test reasoning and aptitude, and speed to answer them
Dsa question easy to medium level
Sorting a linked list can be efficiently done using merge sort due to its O(n log n) time complexity.
Use merge sort as it works well with linked lists due to its divide-and-conquer approach.
Split the linked list into two halves using the slow and fast pointer technique.
Recursively sort both halves and then merge them back together.
Example: For a linked list 4 -> 2 -> 1 -> 3, the sorted list will be 1 -> 2 -...
Check if a string of brackets is valid by ensuring every opening bracket has a corresponding closing bracket in the correct order.
Use a stack to keep track of opening brackets. Example: For '({[]})', push '(', '{', '[' onto the stack.
For each closing bracket, check if it matches the top of the stack. Example: For '}', pop '{' from the stack.
If the stack is empty at the end, the brackets are valid. Example: '()[]{}' is ...
I applied via Campus Placement and was interviewed before Jun 2023. There were 2 interview rounds.
Java , Spring, SQL questions asked without one data structure basic live coding question
It consist of 4 DSA ques and few quiz and opps concept based ques
1st was string based Medium level ques.
2nd was a ques based on 2 pointer
And other 2 was from Vector and Linked list easy ques
Print natural numbers in spiral form using a 2D array.
Create a 2D array with dimensions n x n.
Initialize variables for row and column boundaries.
Iterate through the array in a spiral pattern, filling in natural numbers.
I appeared for an interview before Jun 2024, where I was asked the following questions.
Star behavior signifies the performance and scalability of systems, often used in distributed computing and network analysis.
In distributed systems, star behavior indicates how well a system can handle increased loads without performance degradation.
For example, in a star topology network, the central hub's performance is crucial as it connects all nodes.
In software design, star behavior can refer to how components int...
I appeared for an interview in Mar 2025, where I was asked the following questions.
Longest Common Subsequence (LCS) finds the longest sequence present in both strings without rearranging characters.
LCS is a classic dynamic programming problem.
Example: For strings 'ABCBDAB' and 'BDCAB', LCS is 'BCAB' or 'BDAB'.
The time complexity is O(m * n), where m and n are lengths of the two strings.
A 2D array is typically used to store lengths of LCS for substrings.
Some of the top questions asked at the Paytm Money Software Engineer interview -
based on 1 interview experience
based on 10 reviews
Rating in categories
Senior Software Engineer
79
salaries
| ₹11 L/yr - ₹33.5 L/yr |
Software Engineer
75
salaries
| ₹7 L/yr - ₹18.5 L/yr |
Senior Associate
71
salaries
| ₹3 L/yr - ₹7 L/yr |
Team Lead
49
salaries
| ₹2.5 L/yr - ₹10 L/yr |
Associate
30
salaries
| ₹1 L/yr - ₹5 L/yr |
Angel One
AGS Transact Technologies
Hitachi Payment Services
Rupeek