Knapsack Problem

This is a coding contest based on algorithms, data structures and problem solving. If you are new here, This contest is aimed at developing solutions using C,C++, Java etc

Participants : 4

Ends: 25 Jul 2020

Time: 23:59 PM


Cash Prize

About Contest

This is a coding contest based on algorithms, data structures and problem solving. If you are new here, This contest is aimed at developing solutions using C,C++, Java etc

Problem statement

Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item, or don’t pick it (0-1 property).

Participant Challenge

  • Cash Prize Contest
  • Evaluated By Experts Panel
  • Submission in single zip File


  • 1st Prize - 50 USD
  • 2nd Prize - 35 USD
  • 3rd Prize - 25 USD

Rules and Criteria

    • Please do not discuss your solution ,strategy, suggestions or tips with anyone during your participation in the contest. If you are unsure, email us at .

    • Discussing Infyni's problems or any aspect of a problem, on any other platform on the web, on identification, could lead to disabling of respective accounts and banning from the contest.

    • Almost all programming languages are allowed.

    • Each program will be tested based on our critical test data. However output and input should be exactly as specified in the samples provided

    Please contact for any queries during the contest.
    • This is an individual-participant challenge.

    • After you have built your application, you must do the following:

    • Submit the solution in .zip format

    • At the end of the page, you must complete the following tasks:

    • Upload the following as a zip, tar, or archive:

    • Source file

    • Submit your solution

    • The submissions will be evaluated by a panel of experts. The evaluation parameters include the following:

    • Functionality of the code

    • Design principle used

    • Performance of your solution

    • The evaluation of submissions can take up to 2 week's time.

    • If you do not select a submission file for the offline evaluation, your best submission will be automatically considered.

    • You will have to send your submissions through email

    • In addition to your final submission, you will also have to submit your source file and other files as a .zip or .tar compressed archive.

    • The maximum number of submissions that a participant can make 1.

    • You can use any tools or libraries to build your solution. There is no restriction on the tools that you can use.

    • The Intellectual Property (IP) of the product/code of the winners will belong to Infyni (only when they accept the prize). Other participants will retain the IP over their product/code. They can choose to put it in an open source domain under any license.

    • You will receive your prize after the announcement of results on the contest page and by email. But note that if your nation does not accept PayPal payments, we will not be able to send you any cash prizes.

    • Prizes above are mentioned per individual.

    • In order to claim the prize, your leaderboard score must be reproducible from your code files.

    • Use of external help is prohibited for this challenge. Participants found using someone else's solution will be disqualified.