{"payload":{"header_redesign_enabled":false,"results":[{"id":"458598690","archived":false,"color":"#DA5B0B","followers":2,"has_funding_file":false,"hl_name":"AhmedIssa11/Maximum-Sum-Subarray-Problem-Analysis","hl_trunc_description":"Maximum sum subarray problem using brute force, divide & conquer and dynamic programming ","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":458598690,"name":"Maximum-Sum-Subarray-Problem-Analysis","owner_id":57608414,"owner_login":"AhmedIssa11","updated_at":"2022-10-11T20:43:48.363Z","has_issues":true}},"sponsorable":false,"topics":["algotrading","brute-force","empirical","dynamic-programming","problem-solving","algorithm-analysis","divide-and-conquer","algorithm-design","max-sum","maximum-sum-subarray"],"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":176,"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%253AAhmedIssa11%252FMaximum-Sum-Subarray-Problem-Analysis%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/AhmedIssa11/Maximum-Sum-Subarray-Problem-Analysis/star":{"post":"opNF9Ayux2MfE7p1a8nZGmoDBKna4YAk_bV9tJecgfpIY2Ug6Tr-VvHnUNiVIw2HwUt2l2_B86JkJvVKvODU2g"},"/AhmedIssa11/Maximum-Sum-Subarray-Problem-Analysis/unstar":{"post":"ENcv9FEK4v_djpNdi1nGjra4jOlPl1Y2VymeJPAG3ezt9CWqcmwEyn-bRo96ulAbN1nedCw-07VL0EFw2Vfn4g"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"DikksXTMXCBK6R43SW-ONWh-FmezY_tUN3cMwuafBPT6ropbLC12udZAUQnsaqHzVb46ub25KVEfJ2WqI6XezQ"}}},"title":"Repository search results"}