Maximum Total Distinct Types Over Exactly K Boxes
Company: INFOSYS
Difficulty: hard
Dynamic Programming
Divide and Conquer
Array
Sliding Window
Hash Table
More INFOSYS OA questions
Interview experiences