Grab Greco Senior Software Engineer Interview Questions and Answers

Q1. Print the nodes of a n-ary tree in an arc wise manner as seen from the outside.
Ans. 
Print nodes of n-ary tree in arc wise manner from outside
• Traverse the tree level by level from outside to inside

• Use a queue to keep track of nodes at each level

• Print the nodes at each level in a clockwise or anticlockwise manner
Answered by AI
Add your answer

React based
problem solving round

Mostly DSA expect DP, graph problems

Q1. Graph traversal + DP
Add your answer

Asked medium level graph question.

Asked LLD question with at flow executable.

Q1. Asked HLD questions.
Add your answer

Android topics and basics of DSA. Coding question related to DSA medium level.

Android topics and basics of DSA. Coding question related to DSA medium level.

This was taken by manager and included topics related to security and few concepts/practices implementation in Android/ Google architecture like firebase messaging deep diving, crashlytics deep diving and its working, etc. Coding question related to DSA medium level.

Q1. Pure salary bargaining round.
Add your answer

Sort an array of 0s, 1s and 2s, Design a music player with shuffle functionality: output- int[] with shuffled

Reversing a linked list in groups, diagonal traversal of BT

Q1. Bookmyshow HLD , Write a Mysql query to get the 3rd Highest salary.
Add your answer

Q1. General discussion
Add your answer

Some mcq questions on Java and 2 DSA medium questions

Q1. Spring boot , Java and DSA questions
Add your answer

Q1. Design BookMyShow low level design
Ans. 
BookMyShow low level design for ticket booking system
• Use microservices architecture for scalability and flexibility

• Implement user authentication and authorization for secure transactions

• Utilize databases for storing user and event information

• Include payment gateway integration for seamless transactions
Answered by AI
Add your answer

Q1. Design lru cache and code
Ans. 
LRU cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
• Use a combination of a doubly linked list and a hashmap to implement the LRU cache.

• When an item is accessed, move it to the front of the linked list to mark it as the most recently used item.

• When adding a new item, check if the cache is full. If it is full, remove the least recently used ite...read more
Answered by AI
Add your answer