{"id":24701259,"url":"https://github.com/woohoeon/leetcode","last_synced_at":"2026-05-15T23:02:39.495Z","repository":{"id":102855503,"uuid":"206953469","full_name":"woohoeon/LeetCode","owner":"woohoeon","description":"Solutions to LeetCode challenges.","archived":false,"fork":false,"pushed_at":"2019-12-10T07:49:41.000Z","size":45,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-09T01:34:15.174Z","etag":null,"topics":["leetcode","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":null,"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/woohoeon.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}},"created_at":"2019-09-07T10:40:38.000Z","updated_at":"2019-12-10T07:49:43.000Z","dependencies_parsed_at":"2023-03-05T16:45:36.060Z","dependency_job_id":null,"html_url":"https://github.com/woohoeon/LeetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/woohoeon/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/woohoeon%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/woohoeon%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/woohoeon%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/woohoeon%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/woohoeon","download_url":"https://codeload.github.com/woohoeon/LeetCode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/woohoeon%2FLeetCode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266608970,"owners_count":23955546,"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","status":"online","status_checked_at":"2025-07-23T02:00:09.312Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"robots_txt_url":"https://github.com/robots.txt","online":true,"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-solutions"],"created_at":"2025-01-27T05:07:07.068Z","updated_at":"2026-05-15T23:02:39.394Z","avatar_url":"https://github.com/woohoeon.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode\nSolutions to LeetCode challenges.\n\nhttps://leetcode.com\n\n| # | Title | Solution | Acceptance | Difficulty |\n|---:|:---|:---:|:---:|:---:|\n| 7 | [Reverse Integer (역 정수)](https://leetcode.com/problems/reverse-integer/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/7) | 25% |Easy |\n| 168 | [Excel Sheet Column Title (엑셀 시트 열 제목)](https://leetcode.com/problems/excel-sheet-column-title/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/168) | 29% |Easy |\n| 204 | [Count Primes (소수 카운트)](https://leetcode.com/problems/count-primes/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/204) | 30% |Easy |\n| 404 | [Sum of Left Leaves (왼쪽 잎의 합)](https://leetcode.com/problems/sum-of-left-leaves/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/404) | 49% |Easy |\n| 414 | [Third Maximum Number (세 번째 최대 수)](https://leetcode.com/problems/third-maximum-number/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/414) | 29% |Easy |\n| 665 | [Non-decreasing Array (감소하지 않는 Array)](https://leetcode.com/problems/non-decreasing-array/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/665) | 19% |Easy |\n| 771 | [Jewels and Stones (돌에서 보석찾기)](https://leetcode.com/problems/jewels-and-stones/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/771) | 83% | Easy |\n| 783 | [Minimum Distance Between BST Nodes (BST 노드 사이의 최소 거리)](https://leetcode.com/problems/minimum-distance-between-bst-nodes/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/783) | 50% |Easy |\n| 807 | [Max Increase to Keep City Skyline (도시 스카이 라인을 유지하기위한 최대 증가)](https://leetcode.com/problems/max-increase-to-keep-city-skyline/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/medium/807) | 82% |Medium |\n| 859 | [Buddy Strings (두 개의 문자만 바꾸어 A와 B가 같은지 확인하기)](https://leetcode.com/problems/buddy-strings/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/859) | 27% |Easy |\n| 938 | [Range Sum of BST (BST의 범위 합)](https://leetcode.com/problems/range-sum-of-bst/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/938) | 78% |Easy |\n| 1108 | [Defanging an IP Address (IP 주소 분리)](https://leetcode.com/problems/defanging-an-ip-address/) | [Javascript](https://github.com/woohoeon/LeetCode/tree/master/easy/1108) | 84% |Easy |\n\n# Other\n\n| Title | Solution |\n|:---|:---:|\n| [MissingInteger (배열에 포함되지 않은 가장 작은 정수 찾기)](https://app.codility.com/programmers/lessons/4-counting_elements/missing_integer/) | [Javascript](https://github.com/woohoeon/LeetCode/blob/master/other/MissingInteger.md) |\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwoohoeon%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwoohoeon%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwoohoeon%2Fleetcode/lists"}