{"id":15069013,"url":"https://github.com/nahyeon99/leetcode","last_synced_at":"2026-01-03T12:03:37.829Z","repository":{"id":190389831,"uuid":"682448823","full_name":"nahyeon99/leetcode","owner":"nahyeon99","description":"👾 알고리즘 풀이 저장소 👾","archived":false,"fork":false,"pushed_at":"2024-10-21T14:32:17.000Z","size":210,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-22T19:48:33.403Z","etag":null,"topics":["algorithms","java-11"],"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/nahyeon99.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":"2023-08-24T07:33:38.000Z","updated_at":"2024-10-21T14:32:47.000Z","dependencies_parsed_at":"2023-08-24T12:42:41.433Z","dependency_job_id":"72c11298-2f44-483a-82c6-b3590e361826","html_url":"https://github.com/nahyeon99/leetcode","commit_stats":{"total_commits":126,"total_committers":1,"mean_commits":126.0,"dds":0.0,"last_synced_commit":"8d8afa4f25f32d66cb6632f55279bec7aadb1e9b"},"previous_names":["nahyeon99/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nahyeon99%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nahyeon99%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nahyeon99%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nahyeon99%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nahyeon99","download_url":"https://codeload.github.com/nahyeon99/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243838102,"owners_count":20355982,"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","java-11"],"created_at":"2024-09-25T01:40:03.898Z","updated_at":"2026-01-03T12:03:37.770Z","avatar_url":"https://github.com/nahyeon99.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Structure \u0026 Algorithm\n\n![GitHub last commit](https://img.shields.io/github/last-commit/nahyeon99/leetcode)\n![GitHub commit activity](https://img.shields.io/github/commit-activity/m/nahyeon99/leetcode)\n![GitHub top language](https://img.shields.io/github/languages/top/nahyeon99/leetcode?color=yellow\u0026logo=Java)\n\n## Leetcode Top Interview 150\n\n|    | Problem                                                                                                                      | Blog                                           |\n|:--:|:-----------------------------------------------------------------------------------------------------------------------------|:-----------------------------------------------|\n| 01 | [88. Merge Sorted Array](./src/leetcode/MergeSortedArray/Solution.java)                                                      | [**_link_**](https://nahyeon99.tistory.com/2)  |\n| 02 | [27. Remove Element ](./src/leetcode/RemoveElement/Solution.java)                                                            | [**_link_**](https://nahyeon99.tistory.com/3)  |\n| 03 | [26. Remove Duplicates from Sorted Array](./src/leetcode/RemoveDuplicatesFromSortedArray/Solution.java)                      | [**_link_**](https://nahyeon99.tistory.com/4)  |\n| 04 | [80. Remove Duplicates from Sorted Array II](./src/leetcode/RemoveDuplicatesFromSortedArray2/Solution.java)                  | [**_link_**](https://nahyeon99.tistory.com/6)  |\n| 05 | [169. Majority Element](./src/leetcode/MajorityElement/Solution.java)                                                        | [**_link_**](https://nahyeon99.tistory.com/7)  |\n| 06 | [189. Rotate Array](./src/leetcode/RotateArray/Solution.java)                                                                | [**_link_**](https://nahyeon99.tistory.com/8)  |\n| 07 | [121. Best Time to Buy and Sell Stock](./src/leetcode/BestTimeToBuyAndSellStock/Solution.java)                               | [**_link_**](https://nahyeon99.tistory.com/9)  |\n| 08 | [122. Best Time to Buy and Sell Stock II](./src/leetcode/BestTimeToBuyAndSellStock2/Solution.java)                           | [**_link_**](https://nahyeon99.tistory.com/10) |\n| 09 | [55. Jump Game](./src/leetcode/JumpGame/Solution.java)                                                                       | [**_link_**](https://nahyeon99.tistory.com/11) |\n| 10 | [125. Valid Palindrome](./src/leetcode/ValidPalindrome/Solution.java)                                                        | [**_link_**](https://nahyeon99.tistory.com/12) |\n| 11 | [167. Two Sum II - Input Array Is Sorted](./src/leetcode/TwoSum2_InputArrayIsSorted/Solution.java)                           | [**_link_**](https://nahyeon99.tistory.com/13) |\n| 12 | [209. Minimum Size Subarray Sum](./src/leetcode/MinimumSizeSubarraySum/Solution.java)                                        | [**_link_**](https://nahyeon99.tistory.com/17) |\n| 13 | [3. Longest Substring Without Repeating Characters](./src/leetcode/LongestSubstringWithoutRepeatingCharacters/Solution.java) | [**_link_**](https://nahyeon99.tistory.com/18) |\n| 14 | [141. Linked List Cycle](./src/leetcode/LinkedListCycle/Solution.java)                                                       | [**_link_**](https://nahyeon99.tistory.com/19) |\n| 15 | [2. Add Two Numbers](./src/leetcode/AddTwoNumbers/Solution.java)                                                             | [**_link_**](https://nahyeon99.tistory.com/20) |\n| 16 | [21. Merge Two Sorted Lists](./src/leetcode/MergeTwoSortedLists/Solution.java)                                               | [**_link_**](https://nahyeon99.tistory.com/21) |\n| 17 | [35. Search Insert Position](./src/leetcode/SearchInsertPosition/Solution.java)                                              | [**_link_**](https://nahyeon99.tistory.com/22) |\n| 18 | [74. Search a 2D Matrix](./src/leetcode/SearchA2DMatrix/Solution.java)                                                       | [**_link_**](https://nahyeon99.tistory.com/23) |\n| 19 | [155. Min Stack](./src/leetcode/MinStack/MinStack.java)                                                                      | [**_link_**](https://nahyeon99.tistory.com/24) |\n| 20 | [150. Evaluate Reverse Polish Notation](./src/leetcode/EvaluateReversePolishNotation/Solution2.java)                         | [**_link_**](https://nahyeon99.tistory.com/25) |\n| 21 | [1. Two Sum](./src/leetcode/TwoSum/Solution2.java)                                                                           | [**_link_**](https://nahyeon99.tistory.com/26) |\n| 22 | [219. Contains Duplicate II](./src/leetcode/ContainsDuplicate2/Solution.java)                                                | [**_link_**](https://nahyeon99.tistory.com/27) |\n| 23 | [162. Find Peak Element](./src/leetcode/FindPeakElement/Solution.java)                                                       |                                                |\n| 24 | [148. Sort List](./src/leetcode/SortList/Solution.java)                                                                      | [**_link_**](https://nahyeon99.tistory.com/28) |\n| 25 | [33. Search in Rotated Sorted Array](./src/leetcode/SearchInRotatedSortedArray/Solution.java)                                | [**_link_**](https://nahyeon99.tistory.com/29) |\n| 26 | [153. Find Minimum in Rotated Sorted Array](./src/leetcode/FindMinimumInRotatedSortedArray/Solution.java)                    | [**_link_**](https://nahyeon99.tistory.com/30) |\n| 27 | [530. Minimum Absolute Difference in BST](./src/leetcode/MinimumAbsoluteDifferenceInBST/Solution.java)                       | [**_link_**](https://nahyeon99.tistory.com/32) |\n| 28 | [230. Kth Smallest Element in a BST](./src/leetcode/KthSmallestElementinaBST/Solution.java)                                  | [**_link_**](https://nahyeon99.tistory.com/33) |\n| 29 | [199. Binary Tree Right Side View](./src/leetcode/BinaryTreeRightSideView/Solution.java)                                     | [**_link_**](https://nahyeon99.tistory.com/34) |\n| 30 | [637. Average of Levels in Binary Tree](./src/leetcode/AverageofLevelsinBinaryTree/Solution.java)                            | [**_link_**](https://nahyeon99.tistory.com/35) |\n| 31 | [208. Implement Trie (Prefix Tree)](./src/leetcode/ImplementTrie/Trie2.java)                                                 |                                                |\n| 32 | [211. Design Add and Search Words Data Structure)](./src/leetcode/DesignAddAndSearchWordsDataStructure/WordDictionary.java)  |                                                |\n\n---\n\n## BaekJoon\n\n|    | Problem                                                    | Blog                                           |\n|:--:|:-----------------------------------------------------------|:-----------------------------------------------|\n| 01 | [11659. 구간 합 구하기 4](./src/boj/q11659_구간_합_구하기_4/Main.java) | [**_link_**](https://nahyeon99.tistory.com/36) |\n| 02 | [11660. 구간 합 구하기 5](./src/boj/q11660_구간_합_구하기_5/Main.java) | [**_link_**](https://nahyeon99.tistory.com/37) |\n| 03 | [1253. 좋다](./src/boj/q1253_좋다/Main.java)                   | [**_link_**](https://nahyeon99.tistory.com/38) |\n| 04 | [12891. DNA 비밀번호](./src/boj/q12891_DNA_비밀번호/Main.java)     | [**_link_**](https://nahyeon99.tistory.com/39) |\n| 05 | [11003. 최솟값 찾기](./src/boj/q11003_최솟값_찾기/Main.java)         | [**_link_**](https://nahyeon99.tistory.com/40) |\n| 06 | [17298. 오큰수](./src/boj/q17298_오큰수/Main.java)               | [**_link_**](https://nahyeon99.tistory.com/41) |\n| 07 | [2164. 카드 2](./src/boj/q2164_카드_2/Main.java)               | [**_link_**](https://nahyeon99.tistory.com/42) |\n| 08 | [11286. 절댓값 힙](./src/boj/q11286_절댓값_힙_구현하기/Main.java)      | [**_link_**](https://nahyeon99.tistory.com/43) |\n| 09 | [1377. 버블 소트](./src/boj/q1377_버블_소트/Main.java)             | [**_link_**](https://nahyeon99.tistory.com/44) |\n| 10 | [11399. ATM](./src/boj/q11399_ATM/Main.java)               | [**_link_**](https://nahyeon99.tistory.com/45) |\n| 11 | [11004. K번째 수](./src/boj/q11004_k번째_수/Main.java)           | [**_link_**](https://nahyeon99.tistory.com/46) |\n| 12 | [11724. ATM](./src/boj/q11724_연결_요소의_개수/Main.java)         | [**_link_**](https://nahyeon99.tistory.com/47) |\n| 13 | [2023. 신기한 소수](./src/boj/q2023_신기한_소수/Main.java)           | [**_link_**](https://nahyeon99.tistory.com/48) |\n| 14 | [1260. DFS와 BFS](./src/boj/q1260_DFS와_BFS/Main.java)       | [**_link_**](https://nahyeon99.tistory.com/49) |\n| 15 | [2178. 미로 탐색](./src/boj/q2178_미로_탐색/Main.java)             | [**_link_**](https://nahyeon99.tistory.com/50) |\n| 16 | [1920. 수 찾기](./src/boj/q1920_수_찾기/Main.java)               |                                                |\n| 17 | [2343. 기타 레슨](./src/boj/q2343_기타_레슨/Main.java)             | [**_link_**](https://nahyeon99.tistory.com/51) |\n| 18 | [1300. K번째 수](./src/boj/q1300_K번째_수/Main.java)             | [**_link_**](https://nahyeon99.tistory.com/52) |\n| 19 | [1929. 소수 구하기](./src/boj/q1929_소수_구하기/Main.java)           | [**_link_**](https://nahyeon99.tistory.com/53) |\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnahyeon99%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnahyeon99%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnahyeon99%2Fleetcode/lists"}