Yateem Optician Interview Questions and Answers

Numerical ,verbal ability, English

Q1. Java networking questions
Add your answer

Q1. Experience in college
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

Q1. Background check and
Add your answer

Q1. All about your current profile your skills related questions, theoretical queries about different areas.
Add your answer

Random coding question related to core Java, your problem solving techniques, logical accuracy.

Q1. Current company related questions, salary discussion and others.
Add your answer