Available question text
Solve variations of the classic 0/1 knapsack problem, such as when profits are binary (1 or 2) or when weights are fractional (up to 2 decimal places) but items cannot be partially selected. Apply dynamic programming techniques while handling the specific constraints of each variation.
Related questions
Continue with questions that share topics or the same question type.
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- Alien Dictionary (hard problem from leetcode)
Coding
- It was a live coding assessment where we had to solve a problem in 1 hour while describing our thought process. That was it
Coding
- It was leetcode standard cherry picking problem variant
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Google
Knapsack Problem Variations
Reported Mar 2, 2026 · 2 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source