{"id":18981848,"url":"https://github.com/lemonhu/lintcode","last_synced_at":"2025-07-17T21:34:13.892Z","repository":{"id":115102614,"uuid":"179910243","full_name":"lemonhu/lintcode","owner":"lemonhu","description":"Daily programming exercises, one problem per day.","archived":false,"fork":false,"pushed_at":"2019-08-01T12:16:42.000Z","size":9,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-01T11:41:21.514Z","etag":null,"topics":["code-exercise","job-interviews","lintcode","python3"],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lemonhu.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-04-07T02:41:06.000Z","updated_at":"2019-08-01T12:16:44.000Z","dependencies_parsed_at":"2023-06-14T12:15:12.369Z","dependency_job_id":null,"html_url":"https://github.com/lemonhu/lintcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemonhu%2Flintcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemonhu%2Flintcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemonhu%2Flintcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemonhu%2Flintcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lemonhu","download_url":"https://codeload.github.com/lemonhu/lintcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239986180,"owners_count":19729584,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["code-exercise","job-interviews","lintcode","python3"],"created_at":"2024-11-08T16:11:30.474Z","updated_at":"2025-02-21T09:21:12.392Z","avatar_url":"https://github.com/lemonhu.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# lintcode\nDaily programming exercises, one problem per day.\n\n## [Binary Search](\u003chttps://github.com/lemonhu/lintcode/tree/master/binary_search\u003e)\n\n- Classical Binary Search\n- Find Peak Element\n- First Position of Target\n- First Bad Version\n- Find Minimum in Rotated Sorted Array\n- Search in Rotated Sorted Array\n- Sqrt(x)\n- Search a 2D Matrix\n- Search in Rotated Sorted Array\n\n## [Linked List](https://github.com/lemonhu/lintcode/tree/master/linked_list)\n\n- Reverse Linked List\n- Linked List Cycle II\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flemonhu%2Flintcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flemonhu%2Flintcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flemonhu%2Flintcode/lists"}