{"id":19306207,"url":"https://github.com/akshaykhale1992/leetcode-excercise","last_synced_at":"2025-08-10T08:43:35.208Z","repository":{"id":191985658,"uuid":"685813215","full_name":"akshaykhale1992/leetcode-excercise","owner":"akshaykhale1992","description":"A Repository of some LeetCode problems along with their solutions","archived":false,"fork":false,"pushed_at":"2023-09-06T03:42:54.000Z","size":14,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-24T02:33:23.758Z","etag":null,"topics":["hacktoberfest","hacktoberfest2023","leetcode"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/akshaykhale1992.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}},"created_at":"2023-09-01T04:21:34.000Z","updated_at":"2023-09-27T09:12:15.000Z","dependencies_parsed_at":"2023-09-01T22:16:38.240Z","dependency_job_id":null,"html_url":"https://github.com/akshaykhale1992/leetcode-excercise","commit_stats":null,"previous_names":["akshaykhale1992/leetcode-excercise"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/akshaykhale1992/leetcode-excercise","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaykhale1992%2Fleetcode-excercise","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaykhale1992%2Fleetcode-excercise/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaykhale1992%2Fleetcode-excercise/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaykhale1992%2Fleetcode-excercise/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/akshaykhale1992","download_url":"https://codeload.github.com/akshaykhale1992/leetcode-excercise/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaykhale1992%2Fleetcode-excercise/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269698815,"owners_count":24461198,"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-08-10T02:00:08.965Z","response_time":71,"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":["hacktoberfest","hacktoberfest2023","leetcode"],"created_at":"2024-11-10T00:04:41.620Z","updated_at":"2025-08-10T08:43:35.171Z","avatar_url":"https://github.com/akshaykhale1992.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Exercise\n\nA Repository of some LeetCode problems along with their solutions\n\n# Links:\n\n### - [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)\n\nSolution: [sudoku-validator.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/sudoku-validator.js)\n\n### - [Reverse Integer](https://leetcode.com/problems/reverse-integer/)\n\nSolution: [reverse-integer.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/reverse-integer.js)\n\n### - [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)\n\nSolution: [linked-list-cycle.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/linked-list-cycle.js)\n\n### - [Debounce](https://leetcode.com/problems/debounce/)\n\nSolution: [debounce.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/debounce.js)\n\n### - [Promise Time Limit](https://leetcode.com/problems/promise-time-limit/)\n\nSolution: [promise-time-limit.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/promise-time-limit.js)\n\n### - [First Missing Positive](https://leetcode.com/problems/first-missing-positive/)\n\nSolution: [first-missing-positive.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/first-missing-positive.js)\n\n### - [To Be Or Not To Be](https://leetcode.com/problems/to-be-or-not-to-be/)\n\nSolution: [to-be-or-not-to-be.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/to-be-or-not-to-be.js)\n\n### - [Calculator with Method Chaining](https://leetcode.com/problems/to-be-or-not-to-be/)\n\nSolution: [to-be-or-not-to-be.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/to-be-or-not-to-be.js)\n\n### - [Group By](https://leetcode.com/problems/group-by/)\n\nSolution: [group-by.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/group-by.js)\n\n### - [Add Two Promises](https://leetcode.com/problems/add-two-promises/)\n\nSolution: [promise-chaining.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/promise-chaining.js)\n\n### - [Is Object Empty](https://leetcode.com/problems/is-empty-object/)\n\nSolution: [is-object-empty.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/is-object-empty.js)\n\n### - [Two Sum](https://leetcode.com/problems/two-sum/)\n\nSolution: [two-sum.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/two-sum.js)\n\n### - [Best time to buy and sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n\nSolution: [best-time-to-buy-and-sell-stock.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/best-time-to-buy-and-sell-stock.js)\n\n### - [Roman to Integer](https://leetcode.com/problems/roman-to-integer/)\n\nSolution: [roman-to-integer.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/roman-to-integer.js)\n\n### - [Palindrome Number](https://leetcode.com/problems/palindrome-number/)\n\nSolution: [palindrome-number.js](https://github.com/akshaykhale1992/leetcode-excercise/blob/main/palindrome-number.js)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakshaykhale1992%2Fleetcode-excercise","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fakshaykhale1992%2Fleetcode-excercise","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakshaykhale1992%2Fleetcode-excercise/lists"}