{"id":22199499,"url":"https://github.com/huzaifsk/leetcode","last_synced_at":"2025-03-24T23:44:50.503Z","repository":{"id":260504527,"uuid":"833777649","full_name":"huzaifsk/leetcode","owner":"huzaifsk","description":"My leetcode solutions","archived":false,"fork":false,"pushed_at":"2025-03-03T07:18:18.000Z","size":190,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-03T07:29:12.856Z","etag":null,"topics":["dsa-algorithm","dsa-learning-series","dsa-practice","javascript","learning-by-doing","leetcode","leetcode-javascript","leetcode-solutions","problem-solving"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/huzaif_shaikh/","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/huzaifsk.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}},"created_at":"2024-07-25T18:16:19.000Z","updated_at":"2025-03-03T07:18:21.000Z","dependencies_parsed_at":null,"dependency_job_id":"29c4ef9c-f429-40e1-a551-f289d203bc47","html_url":"https://github.com/huzaifsk/leetcode","commit_stats":null,"previous_names":["huzaifsk/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzaifsk%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzaifsk%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzaifsk%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzaifsk%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/huzaifsk","download_url":"https://codeload.github.com/huzaifsk/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245372219,"owners_count":20604489,"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":["dsa-algorithm","dsa-learning-series","dsa-practice","javascript","learning-by-doing","leetcode","leetcode-javascript","leetcode-solutions","problem-solving"],"created_at":"2024-12-02T15:14:50.090Z","updated_at":"2025-03-24T23:44:50.492Z","avatar_url":"https://github.com/huzaifsk.png","language":"JavaScript","readme":"# LeetCode Solutions\nWelcome to my LeetCode solutions repository! Here, you'll find solutions to various LeetCode problems, all implemented in JavaScript. I’ve organized the solutions by topic to make it easier to navigate and study specific concepts.\n\n# About\nEach solution includes detailed code to help you understand the approach taken to solve each problem. This repository is a work-in-progress as I continue to tackle new problems and add solutions.\n\nFeel free to explore, and if you have suggestions or improvements, don't hesitate to contribute!\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/huzaifsk/leetcode/tree/master/0001-two-sum) |\n| [0013-roman-to-integer](https://github.com/huzaifsk/leetcode/tree/master/0013-roman-to-integer) |\n| [0217-contains-duplicate](https://github.com/huzaifsk/leetcode/tree/master/0217-contains-duplicate) |\n| [0268-missing-number](https://github.com/huzaifsk/leetcode/tree/master/0268-missing-number) |\n| [2053-check-if-all-characters-have-equal-number-of-occurrences](https://github.com/huzaifsk/leetcode/tree/master/2053-check-if-all-characters-have-equal-number-of-occurrences) |\n## Math\n|  |\n| ------- |\n| [0007-reverse-integer](https://github.com/huzaifsk/leetcode/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/huzaifsk/leetcode/tree/master/0009-palindrome-number) |\n| [0013-roman-to-integer](https://github.com/huzaifsk/leetcode/tree/master/0013-roman-to-integer) |\n| [0233-number-of-digit-one](https://github.com/huzaifsk/leetcode/tree/master/0233-number-of-digit-one) |\n| [0268-missing-number](https://github.com/huzaifsk/leetcode/tree/master/0268-missing-number) |\n| [0412-fizz-buzz](https://github.com/huzaifsk/leetcode/tree/master/0412-fizz-buzz) |\n| [1013-fibonacci-number](https://github.com/huzaifsk/leetcode/tree/master/1013-fibonacci-number) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/huzaifsk/leetcode/tree/master/1146-greatest-common-divisor-of-strings) |\n## String\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/huzaifsk/leetcode/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/huzaifsk/leetcode/tree/master/0014-longest-common-prefix) |\n| [0125-valid-palindrome](https://github.com/huzaifsk/leetcode/tree/master/0125-valid-palindrome) |\n| [0412-fizz-buzz](https://github.com/huzaifsk/leetcode/tree/master/0412-fizz-buzz) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/huzaifsk/leetcode/tree/master/1146-greatest-common-divisor-of-strings) |\n| [2053-check-if-all-characters-have-equal-number-of-occurrences](https://github.com/huzaifsk/leetcode/tree/master/2053-check-if-all-characters-have-equal-number-of-occurrences) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0233-number-of-digit-one](https://github.com/huzaifsk/leetcode/tree/master/0233-number-of-digit-one) |\n| [1013-fibonacci-number](https://github.com/huzaifsk/leetcode/tree/master/1013-fibonacci-number) |\n## Recursion\n|  |\n| ------- |\n| [0233-number-of-digit-one](https://github.com/huzaifsk/leetcode/tree/master/0233-number-of-digit-one) |\n| [1013-fibonacci-number](https://github.com/huzaifsk/leetcode/tree/master/1013-fibonacci-number) |\n## Memoization\n|  |\n| ------- |\n| [1013-fibonacci-number](https://github.com/huzaifsk/leetcode/tree/master/1013-fibonacci-number) |\n## Simulation\n|  |\n| ------- |\n| [0412-fizz-buzz](https://github.com/huzaifsk/leetcode/tree/master/0412-fizz-buzz) |\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/huzaifsk/leetcode/tree/master/0001-two-sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/huzaifsk/leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/huzaifsk/leetcode/tree/master/0027-remove-element) |\n| [0035-search-insert-position](https://github.com/huzaifsk/leetcode/tree/master/0035-search-insert-position) |\n| [0217-contains-duplicate](https://github.com/huzaifsk/leetcode/tree/master/0217-contains-duplicate) |\n| [0268-missing-number](https://github.com/huzaifsk/leetcode/tree/master/0268-missing-number) |\n## Sorting\n|  |\n| ------- |\n| [0217-contains-duplicate](https://github.com/huzaifsk/leetcode/tree/master/0217-contains-duplicate) |\n| [0268-missing-number](https://github.com/huzaifsk/leetcode/tree/master/0268-missing-number) |\n## Binary Search\n|  |\n| ------- |\n| [0035-search-insert-position](https://github.com/huzaifsk/leetcode/tree/master/0035-search-insert-position) |\n| [0268-missing-number](https://github.com/huzaifsk/leetcode/tree/master/0268-missing-number) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/huzaifsk/leetcode/tree/master/0268-missing-number) |\n## Two Pointers\n|  |\n| ------- |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/huzaifsk/leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/huzaifsk/leetcode/tree/master/0027-remove-element) |\n| [0125-valid-palindrome](https://github.com/huzaifsk/leetcode/tree/master/0125-valid-palindrome) |\n## Counting\n|  |\n| ------- |\n| [2053-check-if-all-characters-have-equal-number-of-occurrences](https://github.com/huzaifsk/leetcode/tree/master/2053-check-if-all-characters-have-equal-number-of-occurrences) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/huzaifsk/leetcode/tree/master/0014-longest-common-prefix) |\n\u003c!---LeetCode Topics End--\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuzaifsk%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhuzaifsk%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuzaifsk%2Fleetcode/lists"}