interview technical : Question are based on dbms , DSA (Find the sum of odd divisors, given an array of numbers.) They more focused on a problem What and How. be ready to answer any challenge based on technical
Domande di colloquio [1]
Domanda 1
Polymorphism Find the sum of odd divisors, given an array of numbers.
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso GreyOrange (San Francisco, CA)
Colloquio
HR scheduled the interview, and the hiring manager conducted it, mainly focusing on behavioral questions about past experience, teamwork, communication, problem-solving, challenges, decision-making, leadership, and collaboration in previous roles and projects.
Domande di colloquio [1]
Domanda 1
hiring manager mainly focused on behavioral topics, including past projects, teamwork, conflict resolution, communication, leadership experience, problem-solving approaches, and handling challenging situations in previous roles.
Ho presentato la mia candidatura di persona. Ho sostenuto un colloquio presso GreyOrange (Gurgaon, Haryana) nel mese di mag 2026
Colloquio
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.
Domande di colloquio [1]
Domanda 1
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.
