{"id":20333128,"url":"https://github.com/jaebradley/leetcode","last_synced_at":"2026-05-07T22:37:33.201Z","repository":{"id":41322006,"uuid":"105951522","full_name":"jaebradley/leetcode","owner":"jaebradley","description":"Leetcode Problem Solutions","archived":false,"fork":false,"pushed_at":"2026-03-10T23:49:37.000Z","size":19527,"stargazers_count":1,"open_issues_count":5,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-03-11T04:49:46.460Z","etag":null,"topics":["leetcode","leetcode-java","leetcode-solutions","programming-challenges"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jaebradley.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2017-10-05T23:47:58.000Z","updated_at":"2026-03-10T23:49:39.000Z","dependencies_parsed_at":"2024-01-31T14:26:32.147Z","dependency_job_id":"21ca3dfd-d7a4-430d-af0e-c48de3fd4d7d","html_url":"https://github.com/jaebradley/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/jaebradley/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaebradley%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaebradley%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaebradley%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaebradley%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jaebradley","download_url":"https://codeload.github.com/jaebradley/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaebradley%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32759443,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-07T02:14:30.463Z","status":"ssl_error","status_checked_at":"2026-05-07T02:14:29.405Z","response_time":62,"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":["leetcode","leetcode-java","leetcode-solutions","programming-challenges"],"created_at":"2024-11-14T20:29:26.848Z","updated_at":"2026-05-07T22:37:33.187Z","avatar_url":"https://github.com/jaebradley.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode Solutions\n\nHere are solutions (hopefully) to some of the problems on [Leetcode](https://leetcode.com/), which is a collection of programming challenges.\n\n# Problems\n\n* [Array Partition I](https://leetcode.com/problems/array-partition-i/description/)\n    * \u003e Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.\n* [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/description/)\n* [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/)\n    * \u003e Given a string, find the length of the longest substring without repeating characters.\n    * [`CodeReview` discussion](https://github.com/jaebradley/leetcode/blob/master/codereview/IdentifyLengthOfLongestSubstringWithoutRepeatingCharacters.md)\n* [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/)\n* [Single Number](https://leetcode.com/problems/single-number/description/)\n    * \u003e Given an array of integers, every element appears twice except for one. Find that single one.\n* [Two Sum](https://leetcode.com/problems/two-sum/description/)\n    * \u003e Given an array of integers, return indices of the two numbers such that they add up to a specific target.\n      \u003e You may assume that each input would have exactly one solution, and you may not use the same element twice.\n* [Linked List Addition](https://leetcode.com/problems/add-two-numbers/description/)\n    * \u003e You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself.\n* [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/description/)\n    * \u003e Given an array of `n` integers where `n \u003e 1`, `nums`, return an array output such that `output[i]` is equal to the product of all the elements of `nums` except `nums[i]`.\n    * \u003e Solve it without division and in `O(n)`.\n    * For example, given `[1, 2, 3, 4]` return `[24, 12, 8, 6]`.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaebradley%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjaebradley%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaebradley%2Fleetcode/lists"}