분류 전체보기
-
[LeetCode] 143. Reorder List - 노드(Node) + 구현(Implementation) JAVA
2025.02.23
- [LeetCode] 66. Plus One - 구현(Implementation) JAVA 2025.02.16
- [LeetCode] 93. Restore IP Addresses - 깊이우선탐색(DFS) + 구현(Implementation) JAVA 2025.02.16
- [LeetCode] 142. Linked List Cycle II - 깊이우선탐색(DFS) JAVA 2025.02.16
- [LeetCode] 86. Partition List - 노드(Node) + 구현(Implementation) JAVA 2025.02.16
- [LeetCode] 94. Binary Tree Inorder Traversal - 트리(Tree) + 이진 트리(Binary Tree) JAVA 2025.02.09
- [LeetCode] 91. Decode Ways - 동적계획법(Dynamic Programming) JAVA 2025.02.09
- [LeetCode] 227. Basic Calculator II - 스택(Stack) + 문자열(String) + 구현(Implementation) JAVA 2025.02.02
- [LeetCode] 328. Odd Even Linked List - 구현(Implementation) + 아이디어(Idea) JAVA 2025.02.02
- [LeetCode] 173. Binary Search Tree Iterator - 이진탐색트리(Binary Search Tree) + 깊이우선탐색(DFS) JAVA 2025.02.02
- [LeetCode] 151. Reverse Words in a String - 문자열(String) + 구현(Implementation) JAVA 2025.01.26
- [LeetCode] 146. LRU Cache - Class(레퍼런스 객체) + 해시맵(HashMap) + LinkedHashMap JAVA 2025.01.26
- [LeetCode] 116. Populating Next Right Pointers in Each Node - 넓이우선탐색(BFS) + 깊이우선탐색(DFS) + 아이디어(Idea) JAVA 2025.01.26
- [LeetCode] 107. Binary Tree Level Order Traversal II - ArrayList + 깊이우선탐색(DFS) + 넓이우선탐색(BFS) JAVA 2025.01.26
- [LeetCode] 380. Insert Delete GetRandom O(1) - 해시맵(HashMap) + 아이디어(Idea) JAVA 2025.01.18
- [LeetCode] 442. Find All Duplicates in an Array - 해시셋(HashSet) + 아이디어(Idea) JAVA 2025.01.12
- [LeetCode] 518. Coin Change II - 동적계획법(Dynamic Programming) + 깊이우선탐색(DFS) JAVA 2025.01.12
- [LeetCode] 522. Longest Uncommon Subsequence II - 구현(Implementation) + 문자열(Substring) JAVA 2025.01.12
- [LeetCode] 516. Longest Palindromic Subsequence - 동적계획법(Dynamic Programming) + 깊이우선탐색(DFS) + 문자열(String) JAVA 2025.01.12
- [LeetCode] 347. Top K Frequent Elements - 아이디어(Idea) + 해시맵(HashMap) + 우선순위큐(PriorityQueue) JAVA 2025.01.05
- [LeetCode] 486. Predict the Winner - 게임이론(Game Theory) + 동적계획법(Dynamic Programming) + 깊이우선탐색(DFS) JAVA 2025.01.05
- [LeetCode] 300. Longest Increasing Subsequence - 동적계획법(Dynamic Programming) + DFS(깊이우선탐색) + LIS(최장증가부분수열) JAVA 2025.01.05
- [LeetCode] 165. Compare Version Numbers - 문자열(String) + 아이디어(Idea) JAVA 2025.01.01
- [LeetCode] 155. Min Stack - 구현(Implementation) + 아이디어(Idea) JAVA 2025.01.01
- [LeetCode] 102. Binary Tree Level Order Traversal - 깊이우선탐색(DFS) + 넓이우선탐색(BFS) JAVA 2025.01.01
- [LeetCode] 413. Arithmetic Slices - 구현(DFS) JAVA 2024.12.29
- [LeetCode] 1155. Number of Dice Rolls With Target Sum - 동적계획법(Dynamic Programming) JAVA 2024.12.29
- [LeetCode] 122. Best Time to Buy and Sell Stock II - 탐욕법(Greedy) JAVA 2024.12.18
- [LeetCode] 128. Longest Consecutive Sequence - 해시셋(HashSet) JAVA 2024.12.11
- [LeetCode] 98. Validate Binary Search Tree - 이진탐색트리(Binary Search Tree) JAVA 2024.12.11