How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a Medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at BitGo.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at BitGo during technical interviews.

Solve and extend the Knapsack problem | BitGo Interview Question

Solve and extend the Knapsack problem

Last updated: Mar 29, 2026

Quick Overview

This question evaluates a candidate's understanding of dynamic programming for optimization problems, specifically the 0/1 knapsack formulation, space-optimized DP and the ability to reconstruct a chosen item set from compressed state.

BitGo

Aug 12, 2025, 12:00 AM

Software Engineer

Technical Screen

Coding & Algorithms

You are given n items, each with an integer weight and value, and a knapsack capacity W. Implement 0/1 Knapsack to return the maximum total value and also reconstruct one optimal set of item indices. Provide an O(nW) time, O(W) space dynamic programming solution and explain how to reconstruct choices from the compressed state. Then outline how to adapt the solution to unbounded and bounded knapsack variants and analyze time and space complexity.

Comments (0)

Loading comments...

Browse More Questions

More Coding & Algorithms•More BitGo•More Software Engineer•BitGo Software Engineer•BitGo Coding & Algorithms•Software Engineer Coding & Algorithms