Grey Orange Interview Questions, Process, and Tips

Medium level coding questions were asked

Q1. Implementation of Breadth First Search
Ans. 
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...read more
Answered by AI
Add your answer
Q2. Implementation of Depth First Search
Ans. 
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
Answered by AI
Add your answer
Q3. Implementation of Inorder Traversal of a Binary Tree
Ans. 
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
Answered by AI
Add your answer

Q1. Swap Alternative nodes of a Linked list
Ans. 
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
Answered by AI
Add your answer
Q2. Reverse a Linked list
Ans. 
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
Answered by AI
Add your answer

Q1. What is the code to determine the minimum number of dice throws required to reach 100 in a game of Snakes and Ladders?
Ans. 
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
Answered by AI
Add your answer

Q1. What will be the my Job profile
Add your answer
Q2. Company what want to expect to me
Add your answer

Q1. How do you differentiate between a Saas and a non Saas product?
Add your answer