Pergunta de entrevista da empresa GreyOrange

Round 1 • Introduction and project discussion • Basics of frameworks used in the project • Given a binary array, sort it • Implement Min Stack using List Round 2 • Detailed project discussion • Kafka basics • Implement methods for driver matching in a ride-sharing system (with variations) • Focused heavily on concurrency concepts and data structures used Problem Solving Question: Given an N-ary tree, find the minimum number of traversals required to send a message to all nodes/components. Conditions: • A child can receive the message only if its parent already has the message • At one level, only one child node can receive the message at a time Round 3 • Deep discussion on current project • Kafka discussion including retry handling and offset management Problem Solving Question: Many courses are given. Find one valid order in which all courses can be completed. Condition: Courses can have dependencies on each other. Example: Course 3 can only be taken after Course 1.