GALAXY OFFICE AUTOMATION Interview Questions and Answers

Round duration - 70 Minutes
Round difficulty - Hard

Q1. 
Candies Distribution Problem Statement
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...read more
Ans. 
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
• Create an array to store the minimum candies required for each student.

• Iterate through the students' ratings array to determine the minimum candies needed based on the adjacent ratings.

• Consider both left-to-right and right-to-left passes to ensure fair distribution.

• Keep track of the total candies dist
Answered by AI
Add your answer
Q2. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Use Divide and Conquer approach to recursively divide the input array into two halves.

• Merge the sorted halves to produce a completely sorted array.

• Ensure the implementation handles the constraints specified in the problem statement.

• Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Answered by AI
Add your answer