Enco Engineers Combine Product Intern Interview Questions and Answers

Round duration - 125 minutes
Round difficulty - Easy

Timing - Test Link is active for 5 days. It can be taken anytime between that window.
It was conducted on Hackerrank.
Duration - 60 mins
Try to quickly solve the coding question first in around 20 mins and give rest of the time to MCQs. MCQs were of medium level.
Practice the MCQs from codezen. 7-8 questions were similar to those on codezen

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 unused capacity.
• Iterate through the stones and keep track of the minimum weight for each color.

• Use dynamic programming to find the minimum unused capacity after selecting one stone of each color.

• If the knapsack cannot be filled under the given conditions, return -1.

• In the given example, the minimum unused capacity is 1.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Environment - Google Docs shared
The interviewer from Adobe was interactive and helpful throughout the round.

Q1. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Ans. 
Find the node where two linked lists merge, return -1 if no merging occurs.
• Traverse both lists to find their lengths and the difference in lengths

• Move the pointer of the longer list by the difference in lengths

• Traverse both lists simultaneously until they meet at the merging point
Answered by AI
Add your answer