Filter interviews by
I applied via Campus Placement and was interviewed before Jul 2022. There were 4 interview rounds.
Medium level coding questions were asked
Breadth First Search is a graph traversal algorithm that explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
Start by visiting the root node and then visit all the neighbor nodes at the present depth level before moving on to the nodes at the next depth level.
Use a queue data structure to keep track of the nodes to be visited.
Mark each node as visited to avoid re...
Depth First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
Start at a node and explore as far as possible along each branch before backtracking
Use a stack to keep track of nodes to visit
Mark visited nodes to avoid revisiting them
Can be implemented recursively or iteratively
Inorder traversal of a binary tree involves visiting the left subtree, then the root, and finally the right subtree.
Start at the root node
Recursively traverse the left subtree
Visit the current node
Recursively traverse the right subtree
Repeat until all nodes are visited
Swap alternative nodes of a linked list
Iterate through the linked list and swap the data of alternate nodes
Use temporary variables to store data during swapping
Ensure to handle cases where the linked list has an odd number of nodes
Reverse a linked list by changing the next pointers of each node
Start with three pointers: current, prev, and next
Iterate through the linked list, updating the next pointer of each node to point to the previous node
Update prev, current, and next pointers for each iteration
Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
I applied via Naukri.com and was interviewed in Dec 2024. There was 1 interview round.
The code to determine the minimum number of dice throws required to reach 100 in Snakes and Ladders game.
Use Breadth First Search (BFS) algorithm to find the shortest path from 1 to 100 on the Snakes and Ladders board.
Create a queue to store the current position and number of dice throws taken to reach that position.
Keep track of visited positions to avoid revisiting them.
Continue BFS until reaching position 100 and re
posted on 6 Nov 2024
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.
Grey Orange interview questions for popular designations
I applied via Naukri.com and was interviewed in Feb 2024. There were 2 interview rounds.
Get interview-ready with Top Grey Orange Interview Questions
It was the ask mostly about DSA
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
It started with basic introduction, than move ahead with Java, Spring boot question in the end, he asked one leetcode medium question based on DP . Ques : Find a minimum number of jumps required to reach the end of the array, and each index , it can jump arr[index] time at max, you need to calculate minimum number of steps required to reach at the end.
Experienced HR professional with a background in recruitment, employee relations, and training.
Over 5 years of experience in HR roles
Skilled in conducting interviews and onboarding new employees
Strong understanding of labor laws and regulations
Implemented successful employee engagement initiatives
Certified in HR management
I have over 5 years of experience in HR, including recruitment, onboarding, and employee relations.
Recruitment experience includes sourcing candidates, conducting interviews, and making job offers.
Onboarding experience involves coordinating orientation sessions and ensuring new hires have necessary resources.
Employee relations experience includes resolving conflicts, conducting performance evaluations, and implementing...
I applied via Campus Placement and was interviewed in Aug 2023. There were 3 interview rounds.
It was Java based MCQ test and apart from that they asked 2 easy DSA Java problems. The first question was test case writing in which a web application was shown and we had to assume and create test cases based on the scenarios that can happen
I applied via Approached by Company and was interviewed in Aug 2023. There were 2 interview rounds.
I applied via Referral and was interviewed in Feb 2023. There were 3 interview rounds.
Top trending discussions
The duration of Grey Orange interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 29 interviews
Interview experience
based on 330 reviews
Rating in categories
Senior Engineer
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Member of Technical Staff
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Delhivery
Zomato
Swiggy