{"payload":{"header_redesign_enabled":false,"results":[{"id":"358472679","archived":false,"color":"#b07219","followers":1,"has_funding_file":false,"hl_name":"santiagoarevalo/hanoi_towers","hl_trunc_description":"A solving method to the Towers of Hanoi problem, where given a number of cases at the first line, the program can solve the n cases recur…","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":358472679,"name":"hanoi_towers","owner_id":71450411,"owner_login":"santiagoarevalo","updated_at":"2021-04-17T04:52:43.970Z","has_issues":true}},"sponsorable":false,"topics":["recursion","recursive-algorithm","hanoi-towers","file-writing"],"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":75,"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%253Asantiagoarevalo%252Fhanoi_towers%2B%2Blanguage%253AJava","metadata":null,"csrf_tokens":{"/santiagoarevalo/hanoi_towers/star":{"post":"Yc7md7q59F-yLjCelrezsbQML9Pw7hoFrKXxvx9Z5BQ3EUsXLbjGTctOjNClv7om9XBpAuo3EBbOZKhnA1PDtw"},"/santiagoarevalo/hanoi_towers/unstar":{"post":"ex95zZmQRxDgV7zRinBvPao0vK10VP2sfvuLlI67c1X6dy3u6lH4lBBYQHQ0xyDVSad7Nmez4IDc1bql7EeF9w"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"cv9ZJOkvs8NQrmJXx4x_0huBUR8Ef68a6E7NkmK-V1O2e-DaF0SdxNbkVQcjgm8mHQAXwUIEp3FB06izZa2u8A"}}},"title":"Repository search results"}