Brigosha Technologies Embedded Software Engineer Interview Questions and Answers

Round duration - 360 minutes
Round difficulty - Medium

They give you 6 hr. For 6 question but the good part is that you need to complete atleast 1 question and you are good to go.
Round will be cleared only after attempting one question and rest of the questions are for improving your rank.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

• If the complement exists, add the pair to the result list.

• Sort the result list based on the criteria mentioned in the problem statement.
Answered by AI
Add your answer
Q2. 
Minimum Number of Platforms Needed Problem Statement
You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to determine the minimum number of pl...read more
Ans. 
The task is to determine the minimum number of platforms needed at a railway station based on arrival and departure times of trains.
• Sort the arrival and departure times in ascending order.

• Use two pointers to keep track of overlapping schedules.

• Increment platform count when a new train arrives before the previous one departs.
Answered by AI
Add your answer
Q3. 
Minimise Sum Problem Statement
You are given a matrix of 'N' rows and 'M' columns and a non-negative integer 'K'. Determine the minimum possible sum of all elements in each submatrix after performing at m...read more
Ans. 
Given a matrix and a non-negative integer K, find the minimum possible sum of all elements in each submatrix after performing at most K decrements.
• Iterate through all submatrices and find the minimum possible sum after performing decrements

• Keep track of the number of decrements performed on each element

• Use dynamic programming to optimize the solution

• Ensure not to decrease any number below 0

• Return the minimum possible s
Answered by AI
Add your answer
Q4. 
Chocolate Distribution Problem
You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...read more
Ans. 
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
• Sort the array of chocolates packets.

• Use sliding window technique to find the minimum difference between the largest and smallest packets distributed to students.

• Consider edge cases like when number of students is equal to number of packets.
Answered by AI
Add your answer
Q5. 
Prime Time Again Problem Statement
You are given two integers DAY_HOURS and PARTS. Consider a day with DAY_HOURS hours, which can be divided into PARTS equal parts. Your task is to determine the total ins...read more
Ans. 
Calculate total instances of equivalent prime groups in a day divided into equal parts.
• Divide the day into equal parts and find prime numbers in each part.

• Identify prime groups where prime numbers occur at the same position in different parts.

• Count the total instances of equivalent prime groups.

• Ensure each hour in a prime group is in a different part of the day.
Answered by AI
Add your answer
Q6. 
Constellation Identification Problem
Given a matrix named UNIVERSE with 3 rows and 'N' columns, filled with characters {#, *, .}, where:
• '*' represents stars.
• '.' represents empty space.
• '#' repre...read more
Ans. 
The task is to identify constellations shaped like vowels within a matrix filled with characters {#, *, .}.
• Iterate through the matrix to find 3x3 constellations shaped like vowels.

• Check for vowels 'A', 'E', 'I', 'O', 'U' in each 3x3 constellation.

• Print the vowels found in each constellation for each test case.
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy