{"payload":{"header_redesign_enabled":false,"results":[{"id":"253124326","archived":false,"color":"#3572A5","followers":1,"has_funding_file":false,"hl_name":"sudhan-bhattarai/01Knapsack_Dynamic_Programming","hl_trunc_description":"Using Dynamic Programming (DP) method to optimize a 0/1 Knapsack Problem for Amazon shopping list.","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":253124326,"name":"01Knapsack_Dynamic_Programming","owner_id":57644985,"owner_login":"sudhan-bhattarai","updated_at":"2021-01-24T23:30:22.877Z","has_issues":true}},"sponsorable":false,"topics":["python","optimization","dynamic-programming","recursive-algorithm","knapsack01","computational-efficiency"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":85,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Asudhan-bhattarai%252F01Knapsack_Dynamic_Programming%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/sudhan-bhattarai/01Knapsack_Dynamic_Programming/star":{"post":"7biCXqxMKxAZMPkG8h_FrE4q5GhqyVQbDskCAiDH7AEEVEzqml90Tdrxk91sq30LjiShNZXsartDHOnK_c61RQ"},"/sudhan-bhattarai/01Knapsack_Dynamic_Programming/unstar":{"post":"K584R8Pcu8mIqwEqHTFmWbzvhvbd--DYTd1qCGjubvyU4kz9MPSrJYHzril0ArHl5fv5dy8H5L0wjU7jCPCWnw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"gUVlQfNG74z_r_nBsq6w3VtHgM1QBxuJKHojNkBWeNxR1C0lV8Gm-T71i8WMkEyBelfLZXPjEnCRn65Ung-aJQ"}}},"title":"Repository search results"}