Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
Accelerator
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Type
/
to search
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
dongYoun2
/
LeetCode
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
main
Branches
Tags
Go to file
Code
Open more actions menu
Folders and files
Name
Name
Last commit message
Last commit date
Latest commit
History
334 Commits
334 Commits
1. Two Sum
1. Two Sum
100. Same Tree
100. Same Tree
1004. Max Consecutive Ones III
1004. Max Consecutive Ones III
101. Symmetric Tree
101. Symmetric Tree
102. Binary Tree Level Order Traversal
102. Binary Tree Level Order Traversal
103. Binary Tree Zigzag Level Order Traversal
103. Binary Tree Zigzag Level Order Traversal
104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary Tree
1048. Longest String Chain
1048. Longest String Chain
105. Construct Binary Tree from Preorder and Inorder Traversal
105. Construct Binary Tree from Preorder and Inorder Traversal
1052. Grumpy Bookstore Owner
1052. Grumpy Bookstore Owner
106. Construct Binary Tree from Inorder and Postorder Traversal
106. Construct Binary Tree from Inorder and Postorder Traversal
108. Convert Sorted Array to Binary Search Tree
108. Convert Sorted Array to Binary Search Tree
11. Container With Most Water
11. Container With Most Water
1100. Find K-Length Substrings With No Repeated Characters
1100. Find K-Length Substrings With No Repeated Characters
112. Path Sum
112. Path Sum
113. Path Sum II
113. Path Sum II
114. Flatten Binary Tree to Linked List
114. Flatten Binary Tree to Linked List
117. Populating Next Right Pointers in Each Node II
117. Populating Next Right Pointers in Each Node II
1197. Minimum Knight Moves
1197. Minimum Knight Moves
12. Integer to Roman
12. Integer to Roman
120. Triangle
120. Triangle
124. Binary Tree Maximum Path Sum
124. Binary Tree Maximum Path Sum
125. Valid Palindrome
125. Valid Palindrome
127. Word Ladder
127. Word Ladder
128. Longest Consecutive Sequence
128. Longest Consecutive Sequence
129. Sum Root to Leaf Numbers
129. Sum Root to Leaf Numbers
130. Surrounded Regions
130. Surrounded Regions
133. Clone Graph
133. Clone Graph
134. Gas Station
134. Gas Station
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
135. Candy
135. Candy
136. Single Number
136. Single Number
137. Single Number II
137. Single Number II
138. Copy List with Random Pointer
138. Copy List with Random Pointer
1381. Design a Stack With Increment Operation
1381. Design a Stack With Increment Operation
139. Word Break
139. Word Break
141. Linked List Cycle
141. Linked List Cycle
143. Reorder List
143. Reorder List
1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
146. LRU Cache
146. LRU Cache
148. Sort List
148. Sort List
15. 3Sum
15. 3Sum
150. Evaluate Reverse Polish Notation
150. Evaluate Reverse Polish Notation
152. Maximum Product Subarray
152. Maximum Product Subarray
153. Find Minimum in Rotated Sorted Array
153. Find Minimum in Rotated Sorted Array
155. Min Stack
155. Min Stack
159. Longest Substring with At Most Two Distinct Characters
159. Longest Substring with At Most Two Distinct Characters
16. 3Sum Closest
16. 3Sum Closest
162. Find Peak Element
162. Find Peak Element
167. Two Sum II - Input Array Is Sorted
167. Two Sum II - Input Array Is Sorted
169. Majority Element
169. Majority Element
17. Letter Combinations of a Phone Number
17. Letter Combinations of a Phone Number
172. Factorial Trailing Zeroes
172. Factorial Trailing Zeroes
173. Binary Search Tree Iterator
173. Binary Search Tree Iterator
1730. Shortest Path to Get Food
1730. Shortest Path to Get Food
1763. Longest Nice Substring
1763. Longest Nice Substring
179. Largest Number
179. Largest Number
1838. Frequency of the Most Frequent Element
1838. Frequency of the Most Frequent Element
1888. Minimum Number of Flips to Make the Binary String Alternating
1888. Minimum Number of Flips to Make the Binary String Alternating
189. Rotate Array
189. Rotate Array
19. Remove Nth Node From End of List
19. Remove Nth Node From End of List
190. Reverse Bits
190. Reverse Bits
191. Number of 1 Bits
191. Number of 1 Bits
198. House Robber
198. House Robber
1984. Minimum Difference Between Highest and Lowest of K Scores
1984. Minimum Difference Between Highest and Lowest of K Scores
199. Binary Tree Right Side View
199. Binary Tree Right Side View
2. Add Two Numbers
2. Add Two Numbers
20. Valid Parentheses
20. Valid Parentheses
200. Number of Islands
200. Number of Islands
201. Bitwise AND of Numbers Range
201. Bitwise AND of Numbers Range
202. Happy Number
202. Happy Number
205. Isomorphic Strings
205. Isomorphic Strings
207. Course Schedule
207. Course Schedule
208. Implement Trie (Prefix Tree)
208. Implement Trie (Prefix Tree)
209. Minimum Size Subarray Sum
209. Minimum Size Subarray Sum
21. Merge Two Sorted Lists
21. Merge Two Sorted Lists
210. Course Schedule II
210. Course Schedule II
211. Design Add and Search Words Data Structure
211. Design Add and Search Words Data Structure
212. Word Search II
212. Word Search II
215. Kth Largest Element in an Array
215. Kth Largest Element in an Array
219. Contains Duplicate II
219. Contains Duplicate II
22. Generate Parentheses
22. Generate Parentheses
221. Maximal Square
221. Maximal Square
222. Count Complete Tree Nodes
222. Count Complete Tree Nodes
224. Basic Calculator
224. Basic Calculator
226. Invert Binary Tree
226. Invert Binary Tree
227. Basic Calculator II
227. Basic Calculator II
228. Summary Ranges
228. Summary Ranges
23. Merge k Sorted Lists
23. Merge k Sorted Lists
230. Kth Smallest Element in a BST
230. Kth Smallest Element in a BST
234. Palindrome Linked List
234. Palindrome Linked List
236. Lowest Common Ancestor of a Binary Tree
236. Lowest Common Ancestor of a Binary Tree
2379. Minimum Recolors to Get K Consecutive Black Blocks
2379. Minimum Recolors to Get K Consecutive Black Blocks
238. Product of Array Except Self
238. Product of Array Except Self
24. Swap Nodes in Pairs
24. Swap Nodes in Pairs
242. Valid Anagram
242. Valid Anagram
25. Reverse Nodes in k-Group
25. Reverse Nodes in k-Group
253. Meeting Rooms II
253. Meeting Rooms II
261. Graph Valid Tree
261. Graph Valid Tree
2622. Cache With Time Limit
2622. Cache With Time Limit
View all files
Repository files navigation
README
More
items
LeetCode
About
LeetCode Practice
Resources
Readme
Activity
Stars
0
stars
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.