{"payload":{"header_redesign_enabled":false,"results":[{"id":"571273233","archived":true,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"emircetinmemis/maximum-subarray-sum-expandation","hl_trunc_description":"This project is a simple implementation of the Max SubArray problem. To analyze algorithm erficiency, the project uses the following algo…","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":571273233,"name":"maximum-subarray-sum-expandation","owner_id":82613491,"owner_login":"emircetinmemis","updated_at":"2022-12-09T23:17:06.440Z","has_issues":true}},"sponsorable":false,"topics":["python","script","comparison","brute-force","divide-and-conquer","kadanes-algorithm"],"type":"Public archive","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":104,"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%253Aemircetinmemis%252Fmaximum-subarray-sum-expandation%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/emircetinmemis/maximum-subarray-sum-expandation/star":{"post":"LlQ1Pw7g_nf3RPFVb_1m2_mDiavPw7kQD1KdP_jD_u6o7vnZ51RZ0un6eY7G2J8EoP9a_69Xi-p7j2kfhgJsCg"},"/emircetinmemis/maximum-subarray-sum-expandation/unstar":{"post":"UESy2Y575tNPKnxc9szMsEy1IPdDeaG3L8XIkI2wsFzAM_N02vGMpYe8X-Q7d3MNvvbP_Qk_F6RQuWs8Qt5rMA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"F7NQEycHoKyL2YogJHf7ugNDuo9Vd1KJ2RFXQnIljJA9zgHMvoA1hViGd4IYQ7J1kcNLY1o6VIsacUdkkxL3xQ"}}},"title":"Repository search results"}