Name		Name	Last commit message	Last commit date
Latest commit History 30 Commits
.vscode		.vscode
0001-A + B Problem		0001-A + B Problem
0002-Trailing Zeros		0002-Trailing Zeros
0003-Digit Counts		0003-Digit Counts
0004-Ugly Number II		0004-Ugly Number II
0005-Kth Largest Element		0005-Kth Largest Element
0006-Merge Two Sorted Arrays		0006-Merge Two Sorted Arrays
0007-Binary Tree Serialization		0007-Binary Tree Serialization
0008-Rotate String		0008-Rotate String
0009-Fizz Buzz		0009-Fizz Buzz
0010-String Permutation II		0010-String Permutation II
0011-Search Range in Binary Search Tree		0011-Search Range in Binary Search Tree
0012-Min Stack		0012-Min Stack
0013-strStr		0013-strStr
0014-First Position of Target		0014-First Position of Target
0015-Permutations		0015-Permutations
0016-Permutations II		0016-Permutations II
0017-Subsets		0017-Subsets
0018-Subsets II		0018-Subsets II
0020-Dices Sum		0020-Dices Sum
0022-Flatten List		0022-Flatten List
0024-LFU Cache		0024-LFU Cache
0028-Search a 2D Matrix		0028-Search a 2D Matrix
0029-Interleaving String		0029-Interleaving String
0030-Insert Interval		0030-Insert Interval
0031-Partition Array		0031-Partition Array
0032-Minimum Window Substring		0032-Minimum Window Substring
0033-N-Queens		0033-N-Queens
0034-N-Queens II		0034-N-Queens II
0035-Reverse Linked List		0035-Reverse Linked List
0036-Reverse Linked List II		0036-Reverse Linked List II
0038-Search a 2D Matrix II		0038-Search a 2D Matrix II
0039-Recover Rotated Sorted Array		0039-Recover Rotated Sorted Array
0040-Implement Queue by Two Stacks		0040-Implement Queue by Two Stacks
0041-Maximum Subarray		0041-Maximum Subarray
0042-Maximum Subarray II		0042-Maximum Subarray II
0043-Maximum Subarray III		0043-Maximum Subarray III
0044-Minimum Subarray		0044-Minimum Subarray
0045-Maximum Subarray Difference		0045-Maximum Subarray Difference
0046-Majority Number		0046-Majority Number
0047-Majority Number II		0047-Majority Number II
0048-Majority Number III		0048-Majority Number III
0049-Sort Letters by Case		0049-Sort Letters by Case
0050-Product of Array Exclude Itself		0050-Product of Array Exclude Itself
0051-Previous Permutation		0051-Previous Permutation
0052-Next Permutation		0052-Next Permutation
0053-Reverse Words in a String		0053-Reverse Words in a String
0054-String to Integer II		0054-String to Integer II
0055-Compare Strings		0055-Compare Strings
0056-Two Sum		0056-Two Sum
0057-3Sum		0057-3Sum
0058-4Sum		0058-4Sum
0059-3Sum Closest		0059-3Sum Closest
0060-Search Insert Position		0060-Search Insert Position
0061-Search for a Range		0061-Search for a Range
0062-Search in Rotated Sorted Array		0062-Search in Rotated Sorted Array
0063-Search in Rotated Sorted Array II		0063-Search in Rotated Sorted Array II
0064-Merge Sorted Array		0064-Merge Sorted Array
0065-Median of two Sorted Arrays		0065-Median of two Sorted Arrays
0066-Binary Tree Preorder Traversal		0066-Binary Tree Preorder Traversal
0067-Binary Tree Inorder Traversal		0067-Binary Tree Inorder Traversal
0068-Binary Tree Postorder Traversal		0068-Binary Tree Postorder Traversal
0069-Binary Tree Level Order Traversal		0069-Binary Tree Level Order Traversal
0070-Binary Tree Level Order Traversal II		0070-Binary Tree Level Order Traversal II
0071-Binary Tree Zigzag Level Order Traversal		0071-Binary Tree Zigzag Level Order Traversal
0072-Construct Binary Tree from Inorder and Postorder Traversal		0072-Construct Binary Tree from Inorder and Postorder Traversal
0073-Construct Binary Tree from Preorder and Inorder Traversal		0073-Construct Binary Tree from Preorder and Inorder Traversal
0074-First Bad Version		0074-First Bad Version
0075-Find Peak Element		0075-Find Peak Element
0076-Longest Increasing Subsequence		0076-Longest Increasing Subsequence
0077-Longest Common Subsequence		0077-Longest Common Subsequence
0078-Longest Common Prefix		0078-Longest Common Prefix
0079-Longest Common Substring		0079-Longest Common Substring
0080-Median		0080-Median
0081-Data Stream Median		0081-Data Stream Median
0082-Single Number		0082-Single Number
0083-Single Number II		0083-Single Number II
0084-Single Number III		0084-Single Number III
0085-Insert Node in a Binary Search Tree		0085-Insert Node in a Binary Search Tree
0086-Binary Search Tree Iterator		0086-Binary Search Tree Iterator
0087-Remove Node in Binary Search Tree		0087-Remove Node in Binary Search Tree
0088-Lowest Common Ancestor		0088-Lowest Common Ancestor
0089-k Sum		0089-k Sum
0090-k Sum II		0090-k Sum II
0091-Minimum Adjustment Cost		0091-Minimum Adjustment Cost
0092-Backpack		0092-Backpack
0093-Balanced Binary Tree		0093-Balanced Binary Tree
0094-Binary Tree Maximum Path Sum		0094-Binary Tree Maximum Path Sum
0095-Validate Binary Search Tree		0095-Validate Binary Search Tree
0096-Partition List		0096-Partition List
0097-Maximum Depth of Binary Tree		0097-Maximum Depth of Binary Tree
0098-Sort List		0098-Sort List
0099-Reorder List		0099-Reorder List
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
0102-Linked List Cycle		0102-Linked List Cycle
0103-Linked List Cycle II		0103-Linked List Cycle II
0104-Merge k Sorted Lists		0104-Merge k Sorted Lists
0105-Copy List with Random Pointer		0105-Copy List with Random Pointer
0106-Convert Sorted List to Balanced BST		0106-Convert Sorted List to Balanced BST

Repository files navigation

LintCode

LintCode C++ Solution

License

yinyinyin123/LintCode

Folders and files

Latest commit

History