i
GroMo
Filter interviews by
Clear (1)
I applied via Campus Placement
Asked about data interpretation and all these.
Coding test is based on DSA mainly.
Top trending discussions
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 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
Maths,quant for 1 hour duration
Arrays, strings, linked list, palindrome
I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There was 1 interview round.
1 hour 10 mins, MERN Stack, Face to Face. Mongodb, medium DSA Question, callback, eventloop, NodeJS asynchronous working
I was interviewed before Mar 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.
Maintain two pointers, one moving at double the speed of the other, if they meet at any point, there is a cycle.
If one of the pointers reaches the end of the list (null), there is no cycle.
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 for which the Next Greater Element is not yet found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.
Round duration - 60 Minutes
Round difficulty - Medium
Designing an ATM machine involves considering user interface, security measures, transaction processing, and hardware components.
User interface should be intuitive and easy to navigate for users of all ages.
Implement security measures such as PIN entry, card authentication, and encryption to protect user data.
Transaction processing should be fast and reliable, with options for cash withdrawals, deposits, transfers, and...
Round duration - 45 Minutes
Round difficulty - Easy
Tip 1 : Practice DSA daily
Tip 2 : Try to think of the solution first before jumping to the solution
Tip 3 : Go through interview experience
Tip 4 : Have mock interviews
Tip 1 : Know in depth what is there in your resume
Tip 2 : Mention your skills and work properly
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Topics:-
Duration-1.5 hours
Kadane's Algorithm, Even Numbers at even index & odd at odd index, print out the second highest node of the tree
ZigZag tree traversal is a method to traverse a binary tree in a zigzag pattern.
In ZigZag tree traversal, we visit the nodes of a binary tree in a zigzag pattern, moving from left to right and then right to left.
We can use a stack or a queue to implement ZigZag tree traversal.
The algorithm involves maintaining two stacks or two queues to keep track of the nodes at each level.
We start with the root node and alternate be...
I applied via Approached by Company and was interviewed in Jul 2023. There were 3 interview rounds.
Arrays, LinkedList basic dsa questions
To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.
Perform an in-order traversal of the binary tree
Keep track of the two largest nodes encountered
Return the second largest node when traversal is complete
based on 1 interview
Interview experience
Business Analyst
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Advisor
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Relationship Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Upstox
Groww
Zerodha
Paytm Money