Gims Interview Questions and Answers

1 hour

Q1. About Ds and Linux commands
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Colorful Knapsack Problem
You are given a set of 'N' stones, each with a specific weight and color. The goal is to fill a knapsack with exactly 'M' stones, choosing one stone of each color, so that the to...read more
Ans. 
The goal is to fill a knapsack with exactly 'M' stones, choosing one stone of each color, minimizing the unused capacity.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to keep track of the minimum unused capacity for each color and weight combination.

• Iterate through the stones and colors to update the array with the minimum unused capacity.

• Return the minimum unused capacity from the array a
Answered by AI
Add your answer

Round duration - 24 hours
Round difficulty - Medium

Round duration - 25 minutes
Round difficulty - Easy

Most relevant question is Define your self.i think this is opportunity to show yourself.

They said to sell a pen.
I told him advantage & how can this will work. I told as per my knowledge.