{"payload":{"header_redesign_enabled":false,"results":[{"id":"164618674","archived":false,"color":"#f34b7d","followers":2,"has_funding_file":false,"hl_name":"shiningflash/Dynamic-Programming","hl_trunc_description":"Here are some dynamic programming problem solutions.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":164618674,"name":"Dynamic-Programming","owner_id":35567854,"owner_login":"shiningflash","updated_at":"2021-01-24T15:13:28.106Z","has_issues":true}},"sponsorable":false,"topics":["fibonacci","dynamic-programming","longest-common-subsequence","knapsack-problem","dp","coin-change","lcs","knapsack","subset-sum","catalan-numbers","longest-increasing-subsequence","online-judge-solutions","longest-common-substring","competitve-programming","bionomial-co-efficient","longest-palindromic-substring","longest-palindromic-subsequence"],"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":82,"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%253Ashiningflash%252FDynamic-Programming%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/shiningflash/Dynamic-Programming/star":{"post":"bQie2xzOQzH9-h6tZfOYF2y49Tc-dotJbm7g7qzXc2fm6MtdCfbUkEqiwJCwF5w2_ir4aCL9oM2lrkrTOcGaHw"},"/shiningflash/Dynamic-Programming/unstar":{"post":"fWBqVdnRAek5tqhPK1qeZvKFSyhcO9QkrL_Zxmtsf9gtm7QvkuuA3_yXzMJjK0b2UAZA21T__Ng34bvrXxeb6A"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"iZiDZ2WzgjjZkvbLaTYOHJuLjtvG5vDuO8y65Ja4tmtdFVwlZaOnnift0pMxSJWS9Pm_J8Sof2RsCK7YrMZe2Q"}}},"title":"Repository search results"}