LeetLintcode
Introduction
1.
Easy
1.1.
Unique Word Abbreviation
1.2.
Paint Fence
1.3.
Closest BST value
1.4.
Lowest Common Ancestor of a Binary Search Tree
1.5.
Reverse Linked List
1.6.
Roman to Integer
1.7.
Ugly Number
1.8.
Happy Number
1.9.
Merge Two Sorted List
1.10.
Balanced Binary Tree
1.11.
Symmetric Tree
1.12.
Plus One
1.13.
Pascal Triangle I/II
1.14.
Intersection of Two Linked Lists
1.15.
Rectangle Area
1.16.
Valid Sudoku
1.17.
Isomorphic Strings
1.18.
Remove Duplicates from Sorted List
1.19.
Word Pattern
1.20.
Bulls and Cows
1.21.
Zigzag Conversion
2.
Medium
2.1.
shortest-word-distance-ii
2.2.
Binary Tree Upside Down
2.3.
Verify Preorder Sequence in Binary Search Tree
2.4.
Count Univalue Subtrees
2.5.
Serialize and Deserialize Binary Tree
2.6.
successor and predecessor in BST
2.7.
Binary Tree Longest Consecutive Sequence
2.8.
Walls And Gates
2.9.
Binary Tree Vertical Order Traversal
2.10.
Missing Ranges
2.11.
Graph Valid Tree
2.12.
Search Insert Position
2.13.
Integer To Roman Numeral
2.14.
Generate Parentheses
2.15.
Best Time to Buy and Sell Stock with Cooldown
2.16.
Generalized Abbreviation
2.17.
Kth Smallest Element in a BST
2.18.
Swap Nodes in Pairs
2.19.
Container With Most Water
2.20.
LongestIncreasingSubSequence
2.21.
Binary Search Tree Iterator
2.22.
Maximum Size Subarray Sum Equals k
2.23.
Peeking Iterator
2.24.
H-index
2.25.
Power of Three
2.26.
remove duplicates from sorted array ii
2.27.
Different Ways to Add Parentheses
2.28.
Linked List Cycle II
2.29.
Perfect Squares
2.30.
Bitwise AND of Numbers Range
2.31.
Convert Sorted List to Binary Search Tree
3.
Hard
3.1.
Best Meeting Point
4.
Nine Chap Senior
4.1.
Unit 4 Two Pointers
4.2.
Unit 5 Dynamic Programming
5.
Misc
5.1.
Leetcode好答案
5.2.
ACM资料
5.3.
面试题目总结 转载
5.4.
Leetcode Summary
6.
背包九讲读书笔记
6.1.
backpack9
7.
ACM日本书
7.1.
Medium
7.1.1.
Binary Search不仅是查找
8.
TestSyntax
Powered by
GitBook
LeetLintcode
9ChapSenior
九章高级算法笔记