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
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 }}
chenpy
/
LintCode
Public
forked from
terrytong0876/LintCode-1
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Files
Expand file tree
master
Breadcrumbs
LintCode
/
Java
/
Copy path
Directory actions
More options
More options
Directory actions
More options
More options
Latest commit
History
History
History
master
Breadcrumbs
LintCode
/
Java
/
Copy path
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
1. Two Sum.java
1. Two Sum.java
10. Regular Expression Matching.java
10. Regular Expression Matching.java
100. Same Tree.java
100. Same Tree.java
1004. Max Consecutive Ones III.java
1004. Max Consecutive Ones III.java
1007. Minimum Domino Rotations For Equal Row.java
1007. Minimum Domino Rotations For Equal Row.java
1008. Construct Binary Search Tree from Preorder Traversal.java
1008. Construct Binary Search Tree from Preorder Traversal.java
101. Symmetric Tree.java
101. Symmetric Tree.java
102. Binary Tree Level Order Traversal.java
102. Binary Tree Level Order Traversal.java
1021. Remove Outermost Parentheses.java
1021. Remove Outermost Parentheses.java
1026. Maximum Difference Between Node and Ancestor.java
1026. Maximum Difference Between Node and Ancestor.java
103. Binary Tree Zigzag Level Order Traversal.java
103. Binary Tree Zigzag Level Order Traversal.java
1033. Moving Stones Until Consecutive.java
1033. Moving Stones Until Consecutive.java
104. Maximum Depth of Binary Tree.java
104. Maximum Depth of Binary Tree.java
1040. Moving Stones Until Consecutive II.java
1040. Moving Stones Until Consecutive II.java
1041. Robot Bounded In Circle.java
1041. Robot Bounded In Circle.java
1043. Partition Array for Maximum Sum.java
1043. Partition Array for Maximum Sum.java
1048. Longest String Chain.java
1048. Longest String Chain.java
105. Construct Binary Tree from Preorder and Inorder Traversal.java
105. Construct Binary Tree from Preorder and Inorder Traversal.java
1053. Previous Permutation With One Swap.java
1053. Previous Permutation With One Swap.java
1057. Campus Bikes.java
1057. Campus Bikes.java
1060. Missing Element in Sorted Array.java
1060. Missing Element in Sorted Array.java
1091. Shortest Path in Binary Matrix.java
1091. Shortest Path in Binary Matrix.java
1094. Car Pooling.java
1094. Car Pooling.java
110. Balanced Binary Tree.java
110. Balanced Binary Tree.java
1106. Parsing A Boolean Expression.java
1106. Parsing A Boolean Expression.java
1108. Defanging an IP Address.java
1108. Defanging an IP Address.java
111. Minimum Depth of Binary Tree.java
111. Minimum Depth of Binary Tree.java
1110. Delete Nodes And Return Forest.java
1110. Delete Nodes And Return Forest.java
1117. Building H2O.java
1117. Building H2O.java
112. Path Sum.java
112. Path Sum.java
1123. Lowest Common Ancestor of Deepest Leaves.java
1123. Lowest Common Ancestor of Deepest Leaves.java
114. Flatten Binary Tree to Linked List.java
114. Flatten Binary Tree to Linked List.java
1146. Snapshot Array.java
1146. Snapshot Array.java
1153. String Transforms Into Another String.java
1153. String Transforms Into Another String.java
1161. Maximum Level Sum of a Binary Tree.java
1161. Maximum Level Sum of a Binary Tree.java
1170. Compare Strings by Frequency of the Smallest Character.java
1170. Compare Strings by Frequency of the Smallest Character.java
118. Pascal's Triangle.java
118. Pascal's Triangle.java
119. Pascal's Triangle II.java
119. Pascal's Triangle II.java
1197. Minimum Knight Moves.java
1197. Minimum Knight Moves.java
12. Integer to Roman.java
12. Integer to Roman.java
1203. Sort Items by Groups Respecting Dependencies.java
1203. Sort Items by Groups Respecting Dependencies.java
121. Best Time to Buy and Sell Stock.java
121. Best Time to Buy and Sell Stock.java
1213. Intersection of Three Sorted Arrays.java
1213. Intersection of Three Sorted Arrays.java
1216. Valid Palindrome III.java
1216. Valid Palindrome III.java
1219. Path with Maximum Gold.java
1219. Path with Maximum Gold.java
122. Best Time to Buy and Sell Stock II.java
122. Best Time to Buy and Sell Stock II.java
124. Binary Tree Maximum Path Sum.java
124. Binary Tree Maximum Path Sum.java
1249. Minimum Remove to Make Valid Parentheses.java
1249. Minimum Remove to Make Valid Parentheses.java
125. Valid Palindrome.java
125. Valid Palindrome.java
1267. Count Servers that Communicate.java
1267. Count Servers that Communicate.java
13. Roman to Integer.java
13. Roman to Integer.java
1306. Jump Game III.java
1306. Jump Game III.java
131. Palindrome Partitioning.java
131. Palindrome Partitioning.java
133. Clone Graph.java
133. Clone Graph.java
134. Gas Station.java
134. Gas Station.java
136. Single Number.java
136. Single Number.java
138. Copy List with Random Pointer.java
138. Copy List with Random Pointer.java
139. Word Break.java
139. Word Break.java
14. Longest Common Prefix.java
14. Longest Common Prefix.java
140. Word Break II.java
140. Word Break II.java
141. Linked List Cycle.java
141. Linked List Cycle.java
142. Linked List Cycle II.java
142. Linked List Cycle II.java
144. Binary Tree Preorder Traversal.java
144. Binary Tree Preorder Traversal.java
145. Binary Tree Postorder Traversal.java
145. Binary Tree Postorder Traversal.java
146. LRU Cache.java
146. LRU Cache.java
149. Max Points on a Line.java
149. Max Points on a Line.java
15. 3Sum.java
15. 3Sum.java
151. Reverse Words in a String.java
151. Reverse Words in a String.java
152. Maximum Product Subarray.java
152. Maximum Product Subarray.java
156. Binary Tree Upside Down.java
156. Binary Tree Upside Down.java
157. Read N Characters Given Read4.java
157. Read N Characters Given Read4.java
158. Read N Characters Given Read4 II - Call multiple times.java
158. Read N Characters Given Read4 II - Call multiple times.java
159. Longest Substring with At Most Two Distinct Characters.java
159. Longest Substring with At Most Two Distinct Characters.java
160. Intersection of Two Linked Lists.java
160. Intersection of Two Linked Lists.java
168. Excel Sheet Column Title.java
168. Excel Sheet Column Title.java
169. Majority Element.java
169. Majority Element.java
170. Two Sum III - Data structure design.java
170. Two Sum III - Data structure design.java
173. Binary Search Tree Iterator.java
173. Binary Search Tree Iterator.java
189. Rotate Array.java
189. Rotate Array.java
19. Remove Nth Node From End of List.java
19. Remove Nth Node From End of List.java
198. House Robber.java
198. House Robber.java
199. Binary Tree Right Side View.java
199. Binary Tree Right Side View.java
2. Add Two Numbers.java
2. Add Two Numbers.java
20. Valid Parentheses.java
20. Valid Parentheses.java
200. Number of Islands.java
200. Number of Islands.java
202. Happy Number.java
202. Happy Number.java
203. Remove Linked List Elements.java
203. Remove Linked List Elements.java
204. Count Primes.java
204. Count Primes.java
205. Isomorphic Strings.java
205. Isomorphic Strings.java
206. Reverse Linked List.java
206. Reverse Linked List.java
207. Course Schedule.java
207. Course Schedule.java
208. Implement Trie (Prefix Tree).java
208. Implement Trie (Prefix Tree).java
21. Merge Two Sorted Lists.java
21. Merge Two Sorted Lists.java
210. Course Schedule II.java
210. Course Schedule II.java
211. Add and Search Word - Data structure design.java
211. Add and Search Word - Data structure design.java
215. Kth Largest Element in an Array.java
215. Kth Largest Element in an Array.java
217. Contains Duplicate.java
217. Contains Duplicate.java
218. The Skyline Problem.java
218. The Skyline Problem.java
219. Contains Duplicate II.java
219. Contains Duplicate II.java
22. Generate Parentheses.java
22. Generate Parentheses.java
View all files
You can’t perform that action at this time.