{"id":23959518,"url":"https://github.com/sendoud/leetcode-daily-practice","last_synced_at":"2025-10-11T11:02:44.961Z","repository":{"id":196375099,"uuid":"694712056","full_name":"SendouD/Leetcode-daily-practice","owner":"SendouD","description":null,"archived":false,"fork":false,"pushed_at":"2025-07-08T16:21:56.000Z","size":158,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-08T17:34:05.739Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SendouD.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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,"zenodo":null}},"created_at":"2023-09-21T14:39:33.000Z","updated_at":"2025-07-08T16:21:58.000Z","dependencies_parsed_at":"2025-02-24T11:45:20.680Z","dependency_job_id":"13b7005c-8f18-48f9-a97a-d010d4438992","html_url":"https://github.com/SendouD/Leetcode-daily-practice","commit_stats":null,"previous_names":["sendoud/leetcode-daily-practice"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/SendouD/Leetcode-daily-practice","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SendouD%2FLeetcode-daily-practice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SendouD%2FLeetcode-daily-practice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SendouD%2FLeetcode-daily-practice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SendouD%2FLeetcode-daily-practice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SendouD","download_url":"https://codeload.github.com/SendouD/Leetcode-daily-practice/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SendouD%2FLeetcode-daily-practice/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279006916,"owners_count":26084217,"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","status":"online","status_checked_at":"2025-10-11T02:00:06.511Z","response_time":55,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2025-01-06T18:38:33.520Z","updated_at":"2025-10-11T11:02:44.945Z","avatar_url":"https://github.com/SendouD.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0064-minimum-path-sum](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0064-minimum-path-sum) |\n| [0217-contains-duplicate](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0217-contains-duplicate) |\n| [0560-subarray-sum-equals-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0560-subarray-sum-equals-k) |\n| [1428-jump-game-iii](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1428-jump-game-iii) |\n| [2394-count-subarrays-with-score-less-than-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/2394-count-subarrays-with-score-less-than-k) |\n## Hash Table\n|  |\n| ------- |\n| [0217-contains-duplicate](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0217-contains-duplicate) |\n| [0560-subarray-sum-equals-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0560-subarray-sum-equals-k) |\n## Sorting\n|  |\n| ------- |\n| [0217-contains-duplicate](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0217-contains-duplicate) |\n## Linked List\n|  |\n| ------- |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n## Math\n|  |\n| ------- |\n| [0007-reverse-integer](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0007-reverse-integer) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n## Binary Search\n|  |\n| ------- |\n| [2394-count-subarrays-with-score-less-than-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/2394-count-subarrays-with-score-less-than-k) |\n## Sliding Window\n|  |\n| ------- |\n| [2394-count-subarrays-with-score-less-than-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/2394-count-subarrays-with-score-less-than-k) |\n## Prefix Sum\n|  |\n| ------- |\n| [0560-subarray-sum-equals-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0560-subarray-sum-equals-k) |\n| [2394-count-subarrays-with-score-less-than-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/2394-count-subarrays-with-score-less-than-k) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0064-minimum-path-sum](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0064-minimum-path-sum) |\n## Matrix\n|  |\n| ------- |\n| [0064-minimum-path-sum](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0064-minimum-path-sum) |\n## Depth-First Search\n|  |\n| ------- |\n| [1428-jump-game-iii](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1428-jump-game-iii) |\n## Breadth-First Search\n|  |\n| ------- |\n| [1428-jump-game-iii](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1428-jump-game-iii) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsendoud%2Fleetcode-daily-practice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsendoud%2Fleetcode-daily-practice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsendoud%2Fleetcode-daily-practice/lists"}