{"id":26587927,"url":"https://github.com/borischen0203/leetcode-java","last_synced_at":"2026-01-31T16:02:31.417Z","repository":{"id":134743045,"uuid":"300114270","full_name":"borischen0203/Leetcode-JAVA","owner":"borischen0203","description":"Leetcofe practice by Java. Currently solved:104","archived":false,"fork":false,"pushed_at":"2022-12-08T20:26:16.000Z","size":315,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-24T10:18:17.723Z","etag":null,"topics":["java","leetcode-java"],"latest_commit_sha":null,"homepage":"https://leetcode.com/borischen0203/","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/borischen0203.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":"2020-10-01T02:15:35.000Z","updated_at":"2023-06-22T08:27:44.000Z","dependencies_parsed_at":null,"dependency_job_id":"84f29ef2-deae-491e-b311-616411819a13","html_url":"https://github.com/borischen0203/Leetcode-JAVA","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/borischen0203/Leetcode-JAVA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/borischen0203%2FLeetcode-JAVA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/borischen0203%2FLeetcode-JAVA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/borischen0203%2FLeetcode-JAVA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/borischen0203%2FLeetcode-JAVA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/borischen0203","download_url":"https://codeload.github.com/borischen0203/Leetcode-JAVA/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/borischen0203%2FLeetcode-JAVA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28947567,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-31T14:26:55.697Z","status":"ssl_error","status_checked_at":"2026-01-31T14:26:52.545Z","response_time":128,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["java","leetcode-java"],"created_at":"2025-03-23T12:31:22.079Z","updated_at":"2026-01-31T16:02:31.412Z","avatar_url":"https://github.com/borischen0203.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# MyLeetcode\n\nCurrently Solved:96\n\n| ID   | Title                                           | Difficulty |\n| ---- | ----------------------------------------------- | ---------- |\n| 1    | Two Sum                                         | Easy       |\n| 7    | Reverse Integer                                 | Easy       |\n| 9    | Palindrome Number                               | Easy       |\n| 13   | Roman to Integer                                | Easy       |\n| 14   | Longest Common Prefix                           | Easy       |\n| 15   | 3Sum                                            | Medium     |\n| 20   | Valid Parentheses                               | Easy       |\n| 21   | Merge Two Sorted Lists                          | Easy       |\n| 26   | Remove Duplicates from Sorted Array             | Easy       |\n| 27   | Remove Element                                  | Easy       |\n| 35   | Search Insert Position                          | Easy       |\n| 58   | Length of Last Word                             | Easy       |\n| 62   | Unique Paths                                    | Medium     |\n| 70   | Climbing Stairs                                 | Easy       |\n| 74   | Search a 2D Matrix                              | Medium     |\n| 75   | Sort Colors                                     | Medium     |\n| 80   | Remove Duplicates from Sorted Array II          | Medium     |\n| 82   | Remove Duplicates from Sorted List II           | Medium     |\n| 83   | Remove Duplicates from Sorted List              | Easy       |\n| 86   | Partition List                                  | Medium     |\n| 88   | Merge Sorted Array                              | Easy       |\n| 94   | Binary Tree Inorder TraversalMedium             | Medium     |\n| 98   | Validate Binary Search Tree                     | Medium     |\n| 100  | Same Tree                                       | Easy       |\n| 101  | Symmetric Tree                                  | Easy       |\n| 102  | Binary Tree Level Order Traversal               | Medium     |\n| 104  | Maximum Depth of Binary Tree                    | Easy       |\n| 108  | Convert Sorted Array to Binary Search Tree      | Easy       |\n| 114  | Flatten Binary Tree to Linked List              | Medium     |\n| 116  | Populating Next Right Pointers in Each Node     | Medium     |\n| 118  | Pascal's Triangle                               | Easy       |\n| 121  | Best Time to Buy and Sell Stock                 | Easy       |\n| 125  | Valid Palindrome                                | Easy       |\n| 136  | Single Number                                   | Easy       |\n| 141  | Linked List Cycle                               | Easy       |\n| 144  | Binary Tree Preorder Traversal                  | Medium     |\n| 148  | Sort List                                       | Medium     |\n| 160  | Intersection of Two Linked Lists                | Easy       |\n| 169  | Majority Element                                | Easy       |\n| 172  | Factorial Trailing Zeroes                       | Easy       |\n| 189  | Rotate Array                                    | Easy       |\n| 199  | Binary Tree Right Side View                     | Medium     |\n| 200  | Number of Islands                               | Medium     |\n| 202  | Happy Number                                    | Easy       |\n| 203  | Remove Linked List Elements                     | Easy       |\n| 204  | Count Primes                                    | Easy       |\n| 205  | Isomorphic Strings                              | Easy       |\n| 206  | Reverse Linked List                             | Easy       |\n| 217  | Contains Duplicate                              | Easy       |\n| 219  | Contains Duplicate II                           | Easy       |\n| 226  | Invert Binary Tree                              | Easy       |\n| 229  | Majority Element II                             | Medium     |\n| 231  | Power of Two                                    | Easy       |\n| 234  | Palindrome Linked List                          | Easy       |\n| 235  | Lowest Common Ancestor of a Binary Search Tree  | Easy       |\n| 236  | Lowest Common Ancestor of a Binary Tree         | Medium     |\n| 238  | Product of Array Except Self                    | Medium     |\n| 240  | Search a 2D Matrix II                           | Medium     |\n| 242  | Valid Anagram                                   | Easy       |\n| 257  | Binary Tree Paths                               | Easy       |\n| 258  | Add Digits                                      | Easy       |\n| 263  | Ugly Number                                     | Easy       |\n| 268  | Missing Number                                  | Easy       |\n| 278  | First Bad Version                               | Easy       |\n| 283  | Move Zeroes                                     | Easy       |\n| 287  | Find the Duplicate Number                       | Medium     |\n| 290  | Word Pattern                                    | Easy       |\n| 326  | Power of Three                                  | Easy       |\n| 342  | Power of Four                                   | Easy       |\n| 344  | Reverse String                                  | Easy       |\n| 345  | Reverse Vowels of a String                      | Easy       |\n| 349  | Intersection of Two Arrays                      | Easy       |\n| 350  | Intersection of Two Arrays II                   | Easy       |\n| 367  | Valid Perfect Square                            | Easy       |\n| 383  | Ransom Note                                     | Easy       |\n| 387  | First Unique Character in a String              | Easy       |\n| 389  | Find the Difference                             | Easy       |\n| 392  | Is Subsequence                                  | Easy       |\n| 404  | Sum of Left Leaves                              | Easy       |\n| 412  | Fizz Buzz                                       | Easy       |\n| 509  | Fibonacci Number                                | Easy       |\n| 575  | Distribute Candies                              | Easy       |\n| 670  | Maximum Swap                                    | Medium     |\n| 680  | Valid Palindrome II                             | Easy       |\n| 700  | Search in a Binary Search Tree                  | Easy       |\n| 819  | Most Common Word                                | Easy       |\n| 905  | Sort Array By Parity                            | Easy       |\n| 977  | Squares of a Sorted Array                       | Easy       |\n| 1071 | Greatest Common Divisor of Strings              | Easy       |\n| 1160 | Find Words That Can Be Formed by Characters     | Easy       |\n| 1161 | Maximum Level Sum of a Binary Tree              | Medium     |\n| 1331 | Rank Transform of an Array                      | Easy       |\n| 1332 | Remove Palindromic Subsequences                 | Easy       |\n| 1342 | Number of Steps to Reduce a Number to Zero      | Easy       |\n| 1346 | Check If N and Its Double Exist                 | Easy       |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fborischen0203%2Fleetcode-java","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fborischen0203%2Fleetcode-java","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fborischen0203%2Fleetcode-java/lists"}