{"id":25363728,"url":"https://github.com/bhargav-joshi/advanced-algorithms-problems","last_synced_at":"2025-04-09T04:20:46.080Z","repository":{"id":239317905,"uuid":"274720642","full_name":"bhargav-joshi/Advanced-Algorithms-Problems","owner":"bhargav-joshi","description":"Advanced Algorithms Problems | Engineering ","archived":false,"fork":false,"pushed_at":"2020-07-02T12:32:32.000Z","size":6,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-14T22:39:46.167Z","etag":null,"topics":["all-pairs-shortest-path","knapsack-problem","lcs","nqueens-problem"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bhargav-joshi.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-06-24T16:46:46.000Z","updated_at":"2020-10-20T13:55:58.000Z","dependencies_parsed_at":"2024-05-11T14:02:37.981Z","dependency_job_id":null,"html_url":"https://github.com/bhargav-joshi/Advanced-Algorithms-Problems","commit_stats":null,"previous_names":["bhargav-joshi/advanced-algorithms-problems"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhargav-joshi%2FAdvanced-Algorithms-Problems","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhargav-joshi%2FAdvanced-Algorithms-Problems/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhargav-joshi%2FAdvanced-Algorithms-Problems/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhargav-joshi%2FAdvanced-Algorithms-Problems/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bhargav-joshi","download_url":"https://codeload.github.com/bhargav-joshi/Advanced-Algorithms-Problems/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247975637,"owners_count":21026908,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["all-pairs-shortest-path","knapsack-problem","lcs","nqueens-problem"],"created_at":"2025-02-14T22:38:02.123Z","updated_at":"2025-04-09T04:20:46.051Z","avatar_url":"https://github.com/bhargav-joshi.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Advanced-Algorithms-Problems\nAdvanced Algorithms Problems | Engineering \n\n[1]\n### [0/1 Knapsack](https://github.com/bhargav-joshi/Advanced-Algorithms-Problems/blob/master/01knap.c)\n\n* 0-1 Knapsack Problem comes under Dynamic Programming Approach (DP)\n\n* A knapsack is a bag. And the knapsack problem deals with the putting items to the bag based on the value of the items. It aim is to maximise the value inside the bag. In 0-1 Knapsack you can either put the item or discard it, there is no concept of putting some part of item in the knapsack.\n\n#### Easy Example :- \n\n![01](https://user-images.githubusercontent.com/47782249/86358936-f11f6a80-bc8d-11ea-8c76-215f7c75588a.png)\n\n**Here you will learn about 0-1 knapsack problem in C.**\n\nWe are given n items with some weights and corresponding values and a knapsack of capacity W. The items should be placed in the knapsack in such a way that the total value is maximum and total weight should be less than knapsack capacity.\n\nIn this problem 0-1 means that we can’t put the items in fraction. Either put the complete item or ignore it. Below is the solution for this problem in C using dynamic programming.\n\n[2]\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbhargav-joshi%2Fadvanced-algorithms-problems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbhargav-joshi%2Fadvanced-algorithms-problems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbhargav-joshi%2Fadvanced-algorithms-problems/lists"}