{"id":24061032,"url":"https://github.com/bunu23/leetcode","last_synced_at":"2025-06-21T10:06:55.870Z","repository":{"id":270760930,"uuid":"811638819","full_name":"bunu23/leetcode","owner":"bunu23","description":"Solution to LeetCode ","archived":false,"fork":false,"pushed_at":"2025-02-26T01:16:17.000Z","size":81,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-21T10:06:36.594Z","etag":null,"topics":["algorithms","array","binary-search","data-structures","hashmap","java","linked-list","stack","string","traversal-algorithms","tree","two-pointers"],"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/bunu23.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":"2024-06-07T02:11:34.000Z","updated_at":"2025-02-26T01:16:20.000Z","dependencies_parsed_at":"2025-01-02T23:20:26.508Z","dependency_job_id":"7f5fb673-84c2-4dff-88e7-d4c08967883b","html_url":"https://github.com/bunu23/leetcode","commit_stats":null,"previous_names":["bunu23/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/bunu23/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bunu23%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bunu23%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bunu23%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bunu23%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bunu23","download_url":"https://codeload.github.com/bunu23/leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bunu23%2Fleetcode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261103453,"owners_count":23109932,"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":["algorithms","array","binary-search","data-structures","hashmap","java","linked-list","stack","string","traversal-algorithms","tree","two-pointers"],"created_at":"2025-01-09T07:16:19.259Z","updated_at":"2025-06-21T10:06:50.855Z","avatar_url":"https://github.com/bunu23.png","language":"Java","readme":"# LeetCode Solutions (JAVA)\n\n### Table of Contents\n\n1. [Easy](#-easy)\n\n2. [Medium](#-medium)\n\n3. [Hard](#-hard)\n\n---\n\n## 🟢 [Easy](easy)\n\n| #   | Problem                                                                                                                                                                                  | Solution                                                                           | Type                      |\n| --- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------- | ------------------------- |\n| 1   | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/description/)                                                                                                    | [Solution](easy/reverse-linked-list/Solution.java)                                 | LinkedList                |\n| 2   | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/description/)                                                                                              | [Solution](easy/merge-two-sorted-lists/Solution.java)                              | LinkedList                |\n| 3   | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/description/)                                                                                              | [Solution](easy/palindrome-linked-list/Solution.java)                              | LinkedList                |\n| 4   | [Remove Duplicates](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)                                                                                                   | [Solution](easy/remove-duplicates/Solution.java)                                   | LinkedList                |\n| 5   | [ Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/description/)                                                                                                       | [Solution](easy/linked-list-cycle/Solution.java)                                   | LinkedList                |\n| 6   | [ Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/description/)                                                                         | [Solution](easy/intersection-of-two-linked-list/Solution.java)                     | LinkedList                |\n| 7   | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/description/)                                                                                    | [Solution](easy/remove-linked-list-elements/Solution.java)                         | LinkedList                |\n| 8   | [Middle of Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)                                                                                                        | [Solution](easy/middle-of-linked-list/Solution.java)                               | LinkedList                |\n| 9   | [Minimum String Length After Removing Substrings](https://leetcode.com/problems/minimum-string-length-after-removing-substrings/)                                                        | [Solution](easy/minimum-string-length-after-removing-substrings/Solution.java)     | Stack                     |\n| 10  | [Binary Tree InOrder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)                                                                                            | [Solution](easy/binary-tree-inorder-traversal/Solution.java)                       | Stack, Tree               |\n| 11  | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/description/)                                                                              | [Solution](easy/binary-tree-preorder-traversal/Solution.java)                      | Stack, Tree               |\n| 12  | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/description/)                                                                            | [Solution](easy/binary-tree-postorder-traversal/Solution.java)                     | Stack, Tree               |\n| 13  | [Minimum Number of Swaps to Make the String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/description/)                                    | [Solution](easy/minimum-number-of-swaps-to-make-the-string-balanced/Solution.java) | Stack, String,Two Pointer |\n| 14  | [ Palindrome Number](https://leetcode.com/problems/palindrome-number/description/)                                                                                                       | [Solution](easy/palindrome-number/Solution.java)                                   | Math                      |\n| 15  | [ Majority Element](https://leetcode.com/problems/majority-element/description/)                                                                                                         | [Solution](easy/majority-element/Solution.java)                                    | Array                     |\n| 16  | [ Missing Number](https://leetcode.com/problems/missing-number/description/)                                                                                                             | [Solution](easy/missing-number/Solution.java)                                      | Array                     |\n| 17  | [ Move Zeroes](https://leetcode.com/problems/move-zeroes/description/)                                                                                                                   | [Solution](easy/move-zeroes/Solution.java)                                         | Array                     |\n| 18  | [ Roman to Integer](https://leetcode.com/problems/roman-to-integer/description/)                                                                                                         | [Solution](easy/roman-to-integer/Solution.java)                                    | String                    |\n| 19  | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/description/?envType=problem-list-v2\u0026envId=string)                                                           | [Solution](easy/longest-common-prefix/Solution.java)                               | String                    |\n| 20  | [Valid Parenthesis](https://leetcode.com/problems/valid-parentheses/?envType=problem-list-v2\u0026envId=string)                                                                               | [Solution](easy/valid-parentheses/Solution.java)                                   | String , Stack            |\n| 21  | [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/description/?envType=problem-list-v2\u0026envId=string) | [Solution](easy/find-the-index-of-the-first-occurrence-in-a-string/Solution.java)  | String                    |\n| 22  | [Length of Last Word](https://leetcode.com/problems/length-of-last-word/description/?envType=problem-list-v2\u0026envId=string)                                                               | [Solution](easy/length-of-last-word/Solution.java)                                 | String                    |\n| 23  | [ Add Binary](https://leetcode.com/problems/add-binary/description/?envType=problem-list-v2\u0026envId=string)                                                                                | [Solution](easy/add-binary/Solution.java)                                          | String                    |\n| 24  | [ Valid Palindrome](https://leetcode.com/problems/valid-palindrome/description/?envType=problem-list-v2\u0026envId=string)                                                                    | [Solution](easy/valid-palindrome/Solution.java)                                    | String                    |\n| 25  | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/description/?envType=problem-list-v2\u0026envId=string)                                                     | [Solution](easy/excel-sheet-column-title/Solution.java)                            | String                    |\n| 26  | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/description/?envType=problem-list-v2\u0026envId=string)                                                   | [Solution](easy/excel-sheet-column-number/Solution.java)                           | String                    |\n| 27  | [Valid Anagram](https://leetcode.com/problems/valid-anagram/description/?envType=problem-list-v2\u0026envId=string)                                                                           | [Solution](easy/valid-anagram/Solution.java)                                       | String                    |\n| 28  | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/description/?envType=problem-list-v2\u0026envId=string)                                                                   | [Solution](easy/binary-tree-paths/Solution.java)                                   | String                    |\n| 29  | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/description/)                                                                                                      | [Solution](easy/contains-duplicate/Solution.java)                                  | HashSet, Array            |\n\n[Back to TOC](#table-of-contents)\n\n---\n\n## 🟠 [Medium](medium)\n\n| #   | Problem                                                                                                                                     | Solution                                                                        | Type                                 |\n| --- | ------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------- | ------------------------------------ |\n| 1   | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)                                                                           | [Solution](medium/add-two-numbers/Solution.java)                                | LinkedList                           |\n| 2   | [Delete Nodes from Linked List Present in Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/description/) | [Solution](medium/delete-nodes-from-linked-list-present-in-array/Solution.java) | LinkedList                           |\n| 3   | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/description/)                   | [Solution](medium/minimum-add-to-make-parentheses-valid/Solution.java)          | String, Stack                        |\n| 4   | [Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp/description/)                                                         | [Solution](medium/maximum-width-ramp/Solution.java)                             | Array, Stack                         |\n| 5   | [The Number of the Smallest Unoccupied Chair](https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/description/)       | [Solution](medium/the-number-of-the-smallest-unoccupied-chair/Solution.java)    | ArrayList, Priority Queue (Min-Heap) |\n| 6   | [Separate Black and White Balls](https://leetcode.com/problems/separate-black-and-white-balls/description/)                                 | [Solution](medium/separate-black-and-white-balls/Solution.java)                 | String                               |\n| 7   | [Longest Square Streak in an Array](https://leetcode.com/problems/longest-square-streak-in-an-array/description/)                           | [Solution](medium/longest-square-streak-in-an-array/Solution.java)              | Array, HashMap                       |\n| 8   | [ Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/description/)                                    | [Solution](medium/product-of-array-except-self/Solution.java)                   | Array                                |\n\n[Back to TOC](#table-of-contents)\n\n---\n\n## 🔴 [Hard](hard)\n\n| #   | Problem                                                                                     | Solution                                              | Type   |\n| --- | ------------------------------------------------------------------------------------------- | ----------------------------------------------------- | ------ |\n| 1   | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/) | [Solution](hard/first-missing-positive/Solution.java) | Arrays |\n\n[Back to TOC](#table-of-contents)\n\n---\n\n## Directory Structure\n\n```bash\n📂 project-root\n├── 📂 easy\n│   ├── 📂 TwoSum\n│   │   └── Solution.java\n│   ├── 📂 ValidPalindrome\n│       └── Solution.java\n├── 📂 medium\n│   ├── 📂 AddTwoNumbers\n│   │   └── Solution.java\n│   ├── 📂 LongestSubstring\n│       └── Solution.java\n├── 📂 hard\n│   ├── 📂 MedianSortedArrays\n│   │   └── Solution.java\n│   ├── 📂 RegexMatching\n│       └── Solution.java\n└── README.md\n\n```\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbunu23%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbunu23%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbunu23%2Fleetcode/lists"}