InterviewBit Problems
Tushar's Birthday Party : Solved
About the Tushar's Birthday Party : Solved category
(1)
Java Dp Easy Solution with comments
(1)
Solution Similar to coin change Problem
(1)
Easy to understand C++ solution | similar to 0-1 knapsack
(1)
O(n*maxCapacity) solution
(1)
Thoroughly explained simple Java solution
(3)
Easy memoized sol
(2)
Can this solution be made more optimal?
(1)
Simple Solution Using 0/1 Knapsack with Filling Capacity as Weights and Cost as Value and instead of maximizing here we are minimizing the value
(1)
Recursive solution in c++ using 2dArray
(2)
Wrong output?can anyone find the bug?
(1)
A Variation of Unbounded knapsack! C++
(3)
C++ solution | 1D dp
(1)
C++ O(n*1000) knapsack
(1)
Unbounded knapsack C++
(1)
Short and really simple soln CPP
(1)
Java Solution using DP
(2)
Similar to Coin Change II Problem
(1)
Simple and Clean Solution with O(n) space complexity
(1)
Python3 ... Can anyone help me in my approach
(1)
Bingo! knapsack on the greatest capacity and done
(1)
Clean top-down DP in C++
(1)
Short solution in Python
(1)
Solution using 1d Dp
(1)
Doubt in base case
(2)
All test cases not passed
(1)
Why are we sorting the dishes in the solution provided
(1)
Doubt in approach
(3)
Test with custom input is giving expected output but on submitting same input gives wrong
(1)
next page →