{"id":23999390,"url":"https://github.com/rajkumar060301/leet-code","last_synced_at":"2025-02-25T09:41:19.130Z","repository":{"id":270847059,"uuid":"910814191","full_name":"rajkumar060301/leet-code","owner":"rajkumar060301","description":"Here’s a well-crafted repository description for your GitHub repo titled \"LeetCode Solutions\". This description is designed to be clear, informative, and engaging for visitors, including recruiters and fellow developers.","archived":false,"fork":false,"pushed_at":"2025-02-20T17:00:08.000Z","size":179,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-20T18:21:19.085Z","etag":null,"topics":["java","leetcode-cpp","leetcode-java","leetcode-solutions","problem-solving"],"latest_commit_sha":null,"homepage":"","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/rajkumar060301.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":"2025-01-01T14:10:35.000Z","updated_at":"2025-02-20T17:00:12.000Z","dependencies_parsed_at":"2025-01-21T17:29:38.131Z","dependency_job_id":"2f7bf642-a289-4d9e-8686-ba874dc4927b","html_url":"https://github.com/rajkumar060301/leet-code","commit_stats":null,"previous_names":["rajkumar060301/leet-code"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajkumar060301%2Fleet-code","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajkumar060301%2Fleet-code/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajkumar060301%2Fleet-code/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajkumar060301%2Fleet-code/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rajkumar060301","download_url":"https://codeload.github.com/rajkumar060301/leet-code/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240644229,"owners_count":19834386,"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":["java","leetcode-cpp","leetcode-java","leetcode-solutions","problem-solving"],"created_at":"2025-01-07T23:58:39.975Z","updated_at":"2025-02-25T09:41:18.992Z","avatar_url":"https://github.com/rajkumar060301.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# LeetCode Solutions\n\nWelcome to my **LeetCode Solutions** repository! 🚀\n\nThis repository contains my solutions to various **LeetCode problems**, organized by topic and difficulty level. Whether you're preparing for coding interviews, improving your problem-solving skills, or just exploring algorithms and data structures, you'll find helpful solutions here.\n\n---\n\n### **📂 Repository Structure**\n- **Topics**: Solutions are categorized by topics such as Arrays, Strings, Linked Lists, Trees, Dynamic Programming, etc.\n- **Difficulty Levels**: Problems are tagged with their difficulty levels (Easy, Medium, Hard).\n- **Languages**: Solutions are provided in multiple programming languages, including **Java**, **Python**, **C++**, and **JavaScript**.\n\n---\n\n### **🌟 Features**\n- **Detailed Explanations**: Each solution includes a clear explanation of the approach and logic.\n- **Optimized Code**: Solutions are optimized for time and space complexity.\n- **Test Cases**: Includes sample test cases to validate the solutions.\n- **Progress Tracker**: Tracks my progress in solving LeetCode problems.\n\n---\n\n### **🚀 How to Use**\n1. Navigate to the topic or difficulty level you're interested in.\n2. Browse through the solutions and explanations.\n3. Clone the repository to run the code locally:\n   ```bash\n   git clone https://github.com/your-username/leetcode-solutions.git\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## String\n|  |\n| ------- |\n| [0044-wildcard-matching](https://github.com/rajkumar060301/leet-code/tree/master/0044-wildcard-matching) |\n| [0049-group-anagrams](https://github.com/rajkumar060301/leet-code/tree/master/0049-group-anagrams) |\n| [0072-edit-distance](https://github.com/rajkumar060301/leet-code/tree/master/0072-edit-distance) |\n| [0165-compare-version-numbers](https://github.com/rajkumar060301/leet-code/tree/master/0165-compare-version-numbers) |\n| [0168-excel-sheet-column-title](https://github.com/rajkumar060301/leet-code/tree/master/0168-excel-sheet-column-title) |\n| [0205-isomorphic-strings](https://github.com/rajkumar060301/leet-code/tree/master/0205-isomorphic-strings) |\n| [0242-valid-anagram](https://github.com/rajkumar060301/leet-code/tree/master/0242-valid-anagram) |\n| [0273-integer-to-english-words](https://github.com/rajkumar060301/leet-code/tree/master/0273-integer-to-english-words) |\n| [0290-word-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0290-word-pattern) |\n| [0306-additive-number](https://github.com/rajkumar060301/leet-code/tree/master/0306-additive-number) |\n| [0344-reverse-string](https://github.com/rajkumar060301/leet-code/tree/master/0344-reverse-string) |\n| [0387-first-unique-character-in-a-string](https://github.com/rajkumar060301/leet-code/tree/master/0387-first-unique-character-in-a-string) |\n| [0389-find-the-difference](https://github.com/rajkumar060301/leet-code/tree/master/0389-find-the-difference) |\n| [0394-decode-string](https://github.com/rajkumar060301/leet-code/tree/master/0394-decode-string) |\n| [0402-remove-k-digits](https://github.com/rajkumar060301/leet-code/tree/master/0402-remove-k-digits) |\n| [0409-longest-palindrome](https://github.com/rajkumar060301/leet-code/tree/master/0409-longest-palindrome) |\n| [0412-fizz-buzz](https://github.com/rajkumar060301/leet-code/tree/master/0412-fizz-buzz) |\n| [0459-repeated-substring-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0459-repeated-substring-pattern) |\n| [0541-reverse-string-ii](https://github.com/rajkumar060301/leet-code/tree/master/0541-reverse-string-ii) |\n| [0557-reverse-words-in-a-string-iii](https://github.com/rajkumar060301/leet-code/tree/master/0557-reverse-words-in-a-string-iii) |\n| [0567-permutation-in-string](https://github.com/rajkumar060301/leet-code/tree/master/0567-permutation-in-string) |\n| [0742-to-lower-case](https://github.com/rajkumar060301/leet-code/tree/master/0742-to-lower-case) |\n| [0812-rotate-string](https://github.com/rajkumar060301/leet-code/tree/master/0812-rotate-string) |\n| [0878-shifting-letters](https://github.com/rajkumar060301/leet-code/tree/master/0878-shifting-letters) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/rajkumar060301/leet-code/tree/master/0920-uncommon-words-from-two-sentences) |\n| [1044-find-common-characters](https://github.com/rajkumar060301/leet-code/tree/master/1044-find-common-characters) |\n| [1080-camelcase-matching](https://github.com/rajkumar060301/leet-code/tree/master/1080-camelcase-matching) |\n| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/rajkumar060301/leet-code/tree/master/1128-remove-all-adjacent-duplicates-in-string) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/rajkumar060301/leet-code/tree/master/1146-greatest-common-divisor-of-strings) |\n## Stack\n|  |\n| ------- |\n| [0394-decode-string](https://github.com/rajkumar060301/leet-code/tree/master/0394-decode-string) |\n| [0402-remove-k-digits](https://github.com/rajkumar060301/leet-code/tree/master/0402-remove-k-digits) |\n| [0456-132-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0456-132-pattern) |\n| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/rajkumar060301/leet-code/tree/master/1128-remove-all-adjacent-duplicates-in-string) |\n## Greedy\n|  |\n| ------- |\n| [0044-wildcard-matching](https://github.com/rajkumar060301/leet-code/tree/master/0044-wildcard-matching) |\n| [0402-remove-k-digits](https://github.com/rajkumar060301/leet-code/tree/master/0402-remove-k-digits) |\n| [0409-longest-palindrome](https://github.com/rajkumar060301/leet-code/tree/master/0409-longest-palindrome) |\n| [0455-assign-cookies](https://github.com/rajkumar060301/leet-code/tree/master/0455-assign-cookies) |\n| [0605-can-place-flowers](https://github.com/rajkumar060301/leet-code/tree/master/0605-can-place-flowers) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0402-remove-k-digits](https://github.com/rajkumar060301/leet-code/tree/master/0402-remove-k-digits) |\n| [0456-132-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0456-132-pattern) |\n## Array\n|  |\n| ------- |\n| [0046-permutations](https://github.com/rajkumar060301/leet-code/tree/master/0046-permutations) |\n| [0048-rotate-image](https://github.com/rajkumar060301/leet-code/tree/master/0048-rotate-image) |\n| [0049-group-anagrams](https://github.com/rajkumar060301/leet-code/tree/master/0049-group-anagrams) |\n| [0053-maximum-subarray](https://github.com/rajkumar060301/leet-code/tree/master/0053-maximum-subarray) |\n| [0204-count-primes](https://github.com/rajkumar060301/leet-code/tree/master/0204-count-primes) |\n| [0209-minimum-size-subarray-sum](https://github.com/rajkumar060301/leet-code/tree/master/0209-minimum-size-subarray-sum) |\n| [0217-contains-duplicate](https://github.com/rajkumar060301/leet-code/tree/master/0217-contains-duplicate) |\n| [0455-assign-cookies](https://github.com/rajkumar060301/leet-code/tree/master/0455-assign-cookies) |\n| [0456-132-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0456-132-pattern) |\n| [0605-can-place-flowers](https://github.com/rajkumar060301/leet-code/tree/master/0605-can-place-flowers) |\n| [0645-set-mismatch](https://github.com/rajkumar060301/leet-code/tree/master/0645-set-mismatch) |\n| [0777-toeplitz-matrix](https://github.com/rajkumar060301/leet-code/tree/master/0777-toeplitz-matrix) |\n| [0878-shifting-letters](https://github.com/rajkumar060301/leet-code/tree/master/0878-shifting-letters) |\n| [0948-sort-an-array](https://github.com/rajkumar060301/leet-code/tree/master/0948-sort-an-array) |\n| [1044-find-common-characters](https://github.com/rajkumar060301/leet-code/tree/master/1044-find-common-characters) |\n| [1080-camelcase-matching](https://github.com/rajkumar060301/leet-code/tree/master/1080-camelcase-matching) |\n## Backtracking\n|  |\n| ------- |\n| [0046-permutations](https://github.com/rajkumar060301/leet-code/tree/master/0046-permutations) |\n| [0306-additive-number](https://github.com/rajkumar060301/leet-code/tree/master/0306-additive-number) |\n## Hash Table\n|  |\n| ------- |\n| [0049-group-anagrams](https://github.com/rajkumar060301/leet-code/tree/master/0049-group-anagrams) |\n| [0205-isomorphic-strings](https://github.com/rajkumar060301/leet-code/tree/master/0205-isomorphic-strings) |\n| [0217-contains-duplicate](https://github.com/rajkumar060301/leet-code/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/rajkumar060301/leet-code/tree/master/0242-valid-anagram) |\n| [0290-word-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0290-word-pattern) |\n| [0387-first-unique-character-in-a-string](https://github.com/rajkumar060301/leet-code/tree/master/0387-first-unique-character-in-a-string) |\n| [0389-find-the-difference](https://github.com/rajkumar060301/leet-code/tree/master/0389-find-the-difference) |\n| [0409-longest-palindrome](https://github.com/rajkumar060301/leet-code/tree/master/0409-longest-palindrome) |\n| [0567-permutation-in-string](https://github.com/rajkumar060301/leet-code/tree/master/0567-permutation-in-string) |\n| [0645-set-mismatch](https://github.com/rajkumar060301/leet-code/tree/master/0645-set-mismatch) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/rajkumar060301/leet-code/tree/master/0920-uncommon-words-from-two-sentences) |\n| [1044-find-common-characters](https://github.com/rajkumar060301/leet-code/tree/master/1044-find-common-characters) |\n## Sorting\n|  |\n| ------- |\n| [0049-group-anagrams](https://github.com/rajkumar060301/leet-code/tree/master/0049-group-anagrams) |\n| [0217-contains-duplicate](https://github.com/rajkumar060301/leet-code/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/rajkumar060301/leet-code/tree/master/0242-valid-anagram) |\n| [0389-find-the-difference](https://github.com/rajkumar060301/leet-code/tree/master/0389-find-the-difference) |\n| [0455-assign-cookies](https://github.com/rajkumar060301/leet-code/tree/master/0455-assign-cookies) |\n| [0645-set-mismatch](https://github.com/rajkumar060301/leet-code/tree/master/0645-set-mismatch) |\n| [0948-sort-an-array](https://github.com/rajkumar060301/leet-code/tree/master/0948-sort-an-array) |\n## Queue\n|  |\n| ------- |\n| [0387-first-unique-character-in-a-string](https://github.com/rajkumar060301/leet-code/tree/master/0387-first-unique-character-in-a-string) |\n## Counting\n|  |\n| ------- |\n| [0387-first-unique-character-in-a-string](https://github.com/rajkumar060301/leet-code/tree/master/0387-first-unique-character-in-a-string) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/rajkumar060301/leet-code/tree/master/0920-uncommon-words-from-two-sentences) |\n## Math\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/rajkumar060301/leet-code/tree/master/0048-rotate-image) |\n| [0168-excel-sheet-column-title](https://github.com/rajkumar060301/leet-code/tree/master/0168-excel-sheet-column-title) |\n| [0204-count-primes](https://github.com/rajkumar060301/leet-code/tree/master/0204-count-primes) |\n| [0258-add-digits](https://github.com/rajkumar060301/leet-code/tree/master/0258-add-digits) |\n| [0273-integer-to-english-words](https://github.com/rajkumar060301/leet-code/tree/master/0273-integer-to-english-words) |\n| [0412-fizz-buzz](https://github.com/rajkumar060301/leet-code/tree/master/0412-fizz-buzz) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/rajkumar060301/leet-code/tree/master/1146-greatest-common-divisor-of-strings) |\n## Matrix\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/rajkumar060301/leet-code/tree/master/0048-rotate-image) |\n| [0777-toeplitz-matrix](https://github.com/rajkumar060301/leet-code/tree/master/0777-toeplitz-matrix) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0044-wildcard-matching](https://github.com/rajkumar060301/leet-code/tree/master/0044-wildcard-matching) |\n| [0053-maximum-subarray](https://github.com/rajkumar060301/leet-code/tree/master/0053-maximum-subarray) |\n| [0072-edit-distance](https://github.com/rajkumar060301/leet-code/tree/master/0072-edit-distance) |\n## Recursion\n|  |\n| ------- |\n| [0044-wildcard-matching](https://github.com/rajkumar060301/leet-code/tree/master/0044-wildcard-matching) |\n| [0273-integer-to-english-words](https://github.com/rajkumar060301/leet-code/tree/master/0273-integer-to-english-words) |\n| [0394-decode-string](https://github.com/rajkumar060301/leet-code/tree/master/0394-decode-string) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0053-maximum-subarray](https://github.com/rajkumar060301/leet-code/tree/master/0053-maximum-subarray) |\n| [0948-sort-an-array](https://github.com/rajkumar060301/leet-code/tree/master/0948-sort-an-array) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0389-find-the-difference](https://github.com/rajkumar060301/leet-code/tree/master/0389-find-the-difference) |\n| [0645-set-mismatch](https://github.com/rajkumar060301/leet-code/tree/master/0645-set-mismatch) |\n## Two Pointers\n|  |\n| ------- |\n| [0165-compare-version-numbers](https://github.com/rajkumar060301/leet-code/tree/master/0165-compare-version-numbers) |\n| [0344-reverse-string](https://github.com/rajkumar060301/leet-code/tree/master/0344-reverse-string) |\n| [0455-assign-cookies](https://github.com/rajkumar060301/leet-code/tree/master/0455-assign-cookies) |\n| [0541-reverse-string-ii](https://github.com/rajkumar060301/leet-code/tree/master/0541-reverse-string-ii) |\n| [0557-reverse-words-in-a-string-iii](https://github.com/rajkumar060301/leet-code/tree/master/0557-reverse-words-in-a-string-iii) |\n| [0567-permutation-in-string](https://github.com/rajkumar060301/leet-code/tree/master/0567-permutation-in-string) |\n| [1080-camelcase-matching](https://github.com/rajkumar060301/leet-code/tree/master/1080-camelcase-matching) |\n## Binary Search\n|  |\n| ------- |\n| [0209-minimum-size-subarray-sum](https://github.com/rajkumar060301/leet-code/tree/master/0209-minimum-size-subarray-sum) |\n| [0456-132-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0456-132-pattern) |\n## Ordered Set\n|  |\n| ------- |\n| [0456-132-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0456-132-pattern) |\n## String Matching\n|  |\n| ------- |\n| [0459-repeated-substring-pattern](https://github.com/rajkumar060301/leet-code/tree/master/0459-repeated-substring-pattern) |\n| [0812-rotate-string](https://github.com/rajkumar060301/leet-code/tree/master/0812-rotate-string) |\n| [1080-camelcase-matching](https://github.com/rajkumar060301/leet-code/tree/master/1080-camelcase-matching) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/rajkumar060301/leet-code/tree/master/0948-sort-an-array) |\n## Merge Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/rajkumar060301/leet-code/tree/master/0948-sort-an-array) |\n## Bucket Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/rajkumar060301/leet-code/tree/master/0948-sort-an-array) |\n## Radix Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/rajkumar060301/leet-code/tree/master/0948-sort-an-array) |\n## Counting Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/rajkumar060301/leet-code/tree/master/0948-sort-an-array) |\n## Simulation\n|  |\n| ------- |\n| [0258-add-digits](https://github.com/rajkumar060301/leet-code/tree/master/0258-add-digits) |\n| [0412-fizz-buzz](https://github.com/rajkumar060301/leet-code/tree/master/0412-fizz-buzz) |\n## Prefix Sum\n|  |\n| ------- |\n| [0209-minimum-size-subarray-sum](https://github.com/rajkumar060301/leet-code/tree/master/0209-minimum-size-subarray-sum) |\n| [0878-shifting-letters](https://github.com/rajkumar060301/leet-code/tree/master/0878-shifting-letters) |\n## Sliding Window\n|  |\n| ------- |\n| [0209-minimum-size-subarray-sum](https://github.com/rajkumar060301/leet-code/tree/master/0209-minimum-size-subarray-sum) |\n| [0567-permutation-in-string](https://github.com/rajkumar060301/leet-code/tree/master/0567-permutation-in-string) |\n## Number Theory\n|  |\n| ------- |\n| [0204-count-primes](https://github.com/rajkumar060301/leet-code/tree/master/0204-count-primes) |\n| [0258-add-digits](https://github.com/rajkumar060301/leet-code/tree/master/0258-add-digits) |\n## Enumeration\n|  |\n| ------- |\n| [0204-count-primes](https://github.com/rajkumar060301/leet-code/tree/master/0204-count-primes) |\n## Trie\n|  |\n| ------- |\n| [1080-camelcase-matching](https://github.com/rajkumar060301/leet-code/tree/master/1080-camelcase-matching) |\n\u003c!---LeetCode Topics End--\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajkumar060301%2Fleet-code","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frajkumar060301%2Fleet-code","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajkumar060301%2Fleet-code/lists"}