Adarsh Shrivastava | CommonLounge

Follow

AS

Adarsh Shrivastava

Tutorials

Discussions

Comment

Followers

Active In

Competitive Programming

1 reply. Member

Algorithms and Data Structures

Member

Bitcoin and Blockchain

Member

Featured Contributions

NaN.

quiz

Quiz (hard): The Knapsack problem, and Dynamic Programmingby Keshav Dhandhania

In this quiz, you'll come across different versions of the Knapsack problem (5 versions, to be specific) and get better at dynamic programming. Expected time to take full quiz: 30-60 minutes. Enjoy!

Read more…(33 words)

Category: Competitive Programming

comment in this discussion

Adarsh Shrivastava9w

Anyone please clarify , is it 0/1 knapsack problem or fractional because 0/1 knapsack problem can't be solved by greedy approach( correct me if I am wrong)

Read more… (27 words)

Load More