Skip to content
Navigation Menu
Toggle navigation
Sign in
Product
GitHub Copilot
Write better code with AI
GitHub Advanced Security
Find and fix vulnerabilities
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Discussions
Collaborate outside of code
Code Search
Find more, search less
Explore
Why GitHub
All features
Documentation
GitHub Skills
Blog
Solutions
By company size
Enterprises
Small and medium teams
Startups
Nonprofits
By use case
DevSecOps
DevOps
CI/CD
View all use cases
By industry
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
Topics
AI
DevOps
Security
Software Development
View all
Explore
Learning Pathways
Events & Webinars
Ebooks & Whitepapers
Customer Stories
Partners
Executive Insights
Open Source
GitHub Sponsors
Fund open source developers
The ReadME Project
GitHub community articles
Repositories
Topics
Trending
Collections
Enterprise
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
Search or jump to...
Search code, repositories, users, issues, pull requests...
Search syntax tips
Provide feedback
Saved searches
Use saved searches to filter your results more quickly
Sign in
Sign up
Reseting focus
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 }}
Seanforfun
/
Algorithm-and-Leetcode
Public
Notifications
You must be signed in to change notification settings
Fork
208
Star
411
Code
Issues
1
Pull requests
0
Actions
Projects
0
Security
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security
Insights
Files
master
Breadcrumbs
Algorithm-and-Leetcode
/
leetcode
/
Copy path
Directory actions
More options
Directory actions
More options
Latest commit
History
History
master
Breadcrumbs
Algorithm-and-Leetcode
/
leetcode
/
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
Offer
Offer
1.Two Sum.md
1.Two Sum.md
10. Regular Expression Matching.md
10. Regular Expression Matching.md
100. Same Tree.md
100. Same Tree.md
1000. Minimum Cost to Merge Stones.md
1000. Minimum Cost to Merge Stones.md
101. Symmetric Tree.md
101. Symmetric Tree.md
102. Binary Tree Level Order Traversal.md
102. Binary Tree Level Order Traversal.md
103. Binary Tree Zigzag Level Order Traversal.md
103. Binary Tree Zigzag Level Order Traversal.md
104. Maximum Depth of Binary Tree.md
104. Maximum Depth of Binary Tree.md
105. Construct Binary Tree from Preorder and Inorder Traversal.md
105. Construct Binary Tree from Preorder and Inorder Traversal.md
106. Construct Binary Tree from Inorder and Postorder Traversal.md
106. Construct Binary Tree from Inorder and Postorder Traversal.md
107. Binary Tree Level Order Traversal II.md
107. Binary Tree Level Order Traversal II.md
108. Convert Sorted Array to Binary Search Tree.md
108. Convert Sorted Array to Binary Search Tree.md
109. Convert Sorted List to Binary Search Tree.md
109. Convert Sorted List to Binary Search Tree.md
11. Container With Most Water.md
11. Container With Most Water.md
110. Balanced Binary Tree.md
110. Balanced Binary Tree.md
111. Minimum Depth of Binary Tree.md
111. Minimum Depth of Binary Tree.md
112. Path Sum.md
112. Path Sum.md
113. Path Sum II.md
113. Path Sum II.md
114. Flatten Binary Tree to Linked List.md
114. Flatten Binary Tree to Linked List.md
115. Distinct Subsequences.md
115. Distinct Subsequences.md
116. Populating Next Right Pointers in Each Node.md
116. Populating Next Right Pointers in Each Node.md
117. Populating Next Right Pointers in Each Node II.md
117. Populating Next Right Pointers in Each Node II.md
118. Pascal's Triangle.md
118. Pascal's Triangle.md
119. Pascal's Triangle II.md
119. Pascal's Triangle II.md
12. Integer to Roman.md
12. Integer to Roman.md
120. Triangle.md
120. Triangle.md
121. Best Time to Buy and Sell Stock.md
121. Best Time to Buy and Sell Stock.md
122. Best Time to Buy and Sell Stock II.md
122. Best Time to Buy and Sell Stock II.md
123. Best Time to Buy and Sell Stock III.md
123. Best Time to Buy and Sell Stock III.md
124. Binary Tree Maximum Path Sum.md
124. Binary Tree Maximum Path Sum.md
125. Valid Palindrome.md
125. Valid Palindrome.md
126. Word Ladder II.md
126. Word Ladder II.md
127. Word Ladder.md
127. Word Ladder.md
128. Longest Consecutive Sequence.md
128. Longest Consecutive Sequence.md
129. Sum Root to Leaf Numbers.md
129. Sum Root to Leaf Numbers.md
13. Roman to Integer.md
13. Roman to Integer.md
130. Surrounded Regions.md
130. Surrounded Regions.md
131. Palindrome Partitioning.md
131. Palindrome Partitioning.md
132. Palindrome Partitioning II.md
132. Palindrome Partitioning II.md
133. Clone Graph.md
133. Clone Graph.md
134. Gas Station.md
134. Gas Station.md
136. Single Number.md
136. Single Number.md
137. Single Number II.md
137. Single Number II.md
138. Copy List with Random Pointer.md
138. Copy List with Random Pointer.md
139. Word Break.md
139. Word Break.md
14.LongestCommonPrefix.md
14.LongestCommonPrefix.md
140. Word Break II.md
140. Word Break II.md
141. Linked List Cycle.md
141. Linked List Cycle.md
142. Linked List Cycle II.md
142. Linked List Cycle II.md
143. Reorder List.md
143. Reorder List.md
144. Binary Tree Preorder Traversal.md
144. Binary Tree Preorder Traversal.md
145. Binary Tree Postorder Traversal.md
145. Binary Tree Postorder Traversal.md
146. LRU Cache.md
146. LRU Cache.md
147. Insertion Sort List.md
147. Insertion Sort List.md
148. Sort List.md
148. Sort List.md
149. Max Points on a Line.md
149. Max Points on a Line.md
15. 3Sum.md
15. 3Sum.md
150. Evaluate Reverse Polish Notation.md
150. Evaluate Reverse Polish Notation.md
151. Reverse Words in a String.md
151. Reverse Words in a String.md
152. Maximum Product Subarray.md
152. Maximum Product Subarray.md
153. Find Minimum in Rotated Sorted Array.md
153. Find Minimum in Rotated Sorted Array.md
154. Find Minimum in Rotated Sorted Array II.md
154. Find Minimum in Rotated Sorted Array II.md
155. Min Stack.md
155. Min Stack.md
157. Read N Characters Given Read4.md
157. Read N Characters Given Read4.md
158. Read N Characters Given Read4 II - Call multiple times.md
158. Read N Characters Given Read4 II - Call multiple times.md
16. 3Sum Closest.md
16. 3Sum Closest.md
160. Intersection of Two Linked Lists.md
160. Intersection of Two Linked Lists.md
162. Find Peak Element.md
162. Find Peak Element.md
164. Maximum Gap.md
164. Maximum Gap.md
165. Compare Version Numbers.md
165. Compare Version Numbers.md
166. Fraction to Recurring Decimal.md
166. Fraction to Recurring Decimal.md
167. Two Sum II - Input array is sorted.md
167. Two Sum II - Input array is sorted.md
168. Excel Sheet Column Title.md
168. Excel Sheet Column Title.md
169. Majority Element.md
169. Majority Element.md
17. Letter Combinations of a Phone Number.md
17. Letter Combinations of a Phone Number.md
170. Two Sum III - Data structure design.md
170. Two Sum III - Data structure design.md
171. Excel Sheet Column Number.md
171. Excel Sheet Column Number.md
172. Factorial Trailing Zeroes.md
172. Factorial Trailing Zeroes.md
173. Binary Search Tree Iterator.md
173. Binary Search Tree Iterator.md
174. Dungeon Game.md
174. Dungeon Game.md
175. Combine Two Tables.md
175. Combine Two Tables.md
176. Second Highest Salary.md
176. Second Highest Salary.md
177. Nth Highest Salary.md
177. Nth Highest Salary.md
178. Rank Scores.md
178. Rank Scores.md
179. Largest Number.md
179. Largest Number.md
18. 4Sum.md
18. 4Sum.md
180. Consecutive Numbers.md
180. Consecutive Numbers.md
181. Employees Earning More Than Their Managers.md
181. Employees Earning More Than Their Managers.md
182. Duplicate Emails.md
182. Duplicate Emails.md
183. Customers Who Never Order.md
183. Customers Who Never Order.md
184. Department Highest Salary.md
184. Department Highest Salary.md
185. Department Top Three Salaries.md
185. Department Top Three Salaries.md
186. Reverse Words in a String II.md
186. Reverse Words in a String II.md
187. Repeated DNA Sequences.md
187. Repeated DNA Sequences.md
188. Best Time to Buy and Sell Stock IV.md
188. Best Time to Buy and Sell Stock IV.md
189. Rotate Array.md
189. Rotate Array.md
19. Remove Nth Node From End of List.md
19. Remove Nth Node From End of List.md
190. Reverse Bits.md
190. Reverse Bits.md
191. Number of 1 Bits.md
191. Number of 1 Bits.md
View all files
You can’t perform that action at this time.