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
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 }}
apluscs
/
LintCode-Solutions
Public
Notifications
You must be signed in to change notification settings
Fork
3
Star
8
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
master
Branches
Tags
Go to file
Code
Open more actions menu
Latest commit
History
274 Commits
274 Commits
Folders and files
Name
Name
Last commit message
Last commit date
0001. A + B Problem.java
0001. A + B Problem.java
0005. Kth Largest Element.java
0005. Kth Largest Element.java
0006. Merge Two Sorted Arrays
0006. Merge Two Sorted Arrays
0008. Rotate String
0008. Rotate String
0009. Fizz Buzz
0009. Fizz Buzz
0011. Search Range in Binary Search Tree.java
0011. Search Range in Binary Search Tree.java
0013. Implement strStr()
0013. Implement strStr()
0014. First Position of Target
0014. First Position of Target
0020. Dices Sum.java
0020. Dices Sum.java
0028. Search a 2D Matrix
0028. Search a 2D Matrix
0031. Partition Array.java
0031. Partition Array.java
0035. Reverse Linked List
0035. Reverse Linked List
0037. Reverse 3-digit Integer
0037. Reverse 3-digit Integer
0039. Recover Rotated Sorted Array
0039. Recover Rotated Sorted Array
0041. Maximum Subarray
0041. Maximum Subarray
0044. Minimum Subarray
0044. Minimum Subarray
0050. Product of Array Exclude Itself
0050. Product of Array Exclude Itself
0053. Reverse Words in a String
0053. Reverse Words in a String
0055. Compare Strings
0055. Compare Strings
0056. Two Sum
0056. Two Sum
0057. 3Sum.java
0057. 3Sum.java
0060. Search Insert Position
0060. Search Insert Position
0061. Search for a Range.java
0061. Search for a Range.java
0062. Search in Rotated Sorted Array.java
0062. Search in Rotated Sorted Array.java
0063. Search in Rotated Sorted Array II.java
0063. Search in Rotated Sorted Array II.java
0064. Merge Sorted Array
0064. Merge Sorted Array
0066. Binary Tree Preorder Traversal.java
0066. Binary Tree Preorder Traversal.java
0069. Binary Tree Level Order Traversal.java
0069. Binary Tree Level Order Traversal.java
0074. First Bad Version.java
0074. First Bad Version.java
0076. Longest Increasing Subsequence.java
0076. Longest Increasing Subsequence.java
0077. Longest Common Subsequence.java
0077. Longest Common Subsequence.java
0079. Longest Common Substring.java
0079. Longest Common Substring.java
0080. Median
0080. Median
0082. Single Number.java
0082. Single Number.java
0085. Insert Node in a Binary Search Tree.java
0085. Insert Node in a Binary Search Tree.java
0096. Partition List.java
0096. Partition List.java
0100. Remove Duplicates from Sorted Array
0100. Remove Duplicates from Sorted Array
0101. Remove Duplicates from Sorted Array II
0101. Remove Duplicates from Sorted Array II
0111. Climbing Stairs.java
0111. Climbing Stairs.java
0112. Remove Duplicates from Sorted List.java
0112. Remove Duplicates from Sorted List.java
0114. Unique Paths
0114. Unique Paths
0115. Unique Paths II
0115. Unique Paths II
0119. Edit Distance.java
0119. Edit Distance.java
0138. Subarray Sum
0138. Subarray Sum
0141. Sqrt(x).java
0141. Sqrt(x).java
0143. Sort Colors II.java
0143. Sort Colors II.java
0147. Lowercase to Uppercase
0147. Lowercase to Uppercase
0147. Narcissitic Number.java
0147. Narcissitic Number.java
0156. Merge Intervals
0156. Merge Intervals
0157. Unique Characters
0157. Unique Characters
0161. Rotate Image
0161. Rotate Image
0163. Unique Binary Search Trees.java
0163. Unique Binary Search Trees.java
0165. Merge Two Sorted Lists.java
0165. Merge Two Sorted Lists.java
0166. Nth to Last Node in List.java
0166. Nth to Last Node in List.java
0167. Add Two Numbers.java
0167. Add Two Numbers.java
0169. Tower of Hanoi.java
0169. Tower of Hanoi.java
0172. Remove Element
0172. Remove Element
0173. Insertion Sort List.java
0173. Insertion Sort List.java
0174. Remove Nth Node From End of List.java
0174. Remove Nth Node From End of List.java
0175. Invert Binary Tree.java
0175. Invert Binary Tree.java
0191. Maximum Product Subarray.java
0191. Maximum Product Subarray.java
0209. First Unique Character in a String.java
0209. First Unique Character in a String.java
0217. Remove Duplicates from Unsorted List.java
0217. Remove Duplicates from Unsorted List.java
0219. Insert Node in Sorted Linked List.java
0219. Insert Node in Sorted Linked List.java
0227. Mock Hanoi Tower by Stacks.java
0227. Mock Hanoi Tower by Stacks.java
0228. Middle of Linked List.java
0228. Middle of Linked List.java
0229. Stack Sorting.java
0229. Stack Sorting.java
0242. Convert Binary Tree to Linked Lists by Depth.java
0242. Convert Binary Tree to Linked Lists by Depth.java
0269. two colors' tower.cpp
0269. two colors' tower.cpp
0363. Trapping Rain Water.java
0363. Trapping Rain Water.java
0365. Count 1 in Binary.java
0365. Count 1 in Binary.java
0366. Fibonacci
0366. Fibonacci
0372. Delete Node in a Linked List.java
0372. Delete Node in a Linked List.java
0373. Partition Array by Odd and Even
0373. Partition Array by Odd and Even
0376. Binary Tree Path Sum.java
0376. Binary Tree Path Sum.java
0383. Container With Most Water.java
0383. Container With Most Water.java
0389. Valid Sudoku.java
0389. Valid Sudoku.java
0392. House Robber.java
0392. House Robber.java
0394. Coins in a Line.java
0394. Coins in a Line.java
0397. Longest Continuous Increasing Subsequence
0397. Longest Continuous Increasing Subsequence
0407. Plus One
0407. Plus One
0423. Valid Parentheses.java
0423. Valid Parentheses.java
0427. Generate Parentheses.java
0427. Generate Parentheses.java
0451. Swap Nodes in Pairs.java
0451. Swap Nodes in Pairs.java
0452. Remove Linked List Elements.java
0452. Remove Linked List Elements.java
0454. Rectangle Area
0454. Rectangle Area
0457. Classical Binary Search.java
0457. Classical Binary Search.java
0458. Last Position of Target.java
0458. Last Position of Target.java
0463. Sort Integers
0463. Sort Integers
0464. Sort Integers II.java
0464. Sort Integers II.java
0466. Count Linked List Nodes
0466. Count Linked List Nodes
0479. Second Max of Array
0479. Second Max of Array
0484. Swap Two Integers in Array
0484. Swap Two Integers in Array
0487. Name Deduplication
0487. Name Deduplication
0488. Happy Number
0488. Happy Number
0489. Convert Array List to Linked List.java
0489. Convert Array List to Linked List.java
0490. Set of Stacks.java
0490. Set of Stacks.java
0491. Palindrome Number
0491. Palindrome Number
0492. Implement Queue by Linked List.java
0492. Implement Queue by Linked List.java
0493. Implement Queue by Linked List II.java
0493. Implement Queue by Linked List II.java
View all files
About
No description or website provided.
Topics
lintcode-java
Activity
Stars
8
stars
Watchers
0
watching
Forks
3
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.