Lintcode - Algorithm
Introduction
1. strStr & Coding style (9)
1.1 strStr
1.2 strStr II (Optional)
1.3 Permutation & Combination
1.3.1 Subsets
1.3.2 Subsets II
1.3.3 Permutations
1.3.4 Permutations II
1.3.5 Letter Combinations of a Phone Number
1.3.6 Palindrome Partitioning
1.3.7 Restore IP Addresses
2. Binary Search (25)
2.1 Closest Number In Sorted Array
2.2 Last Position of Target
2.3 Search a 2D Matrix
2.4 Maximum Number in Mountain Sequence
2.5 Search In a Big Sorted Array
2.6 Find Minimum in Rotated Sorted Array
2.7 Find Peak Element
2.8 First Bad Version
2.9 Search in Rotated Sorted Array
2.10 Smallest Rectangle Enclosing Black Pixels
2.11 Total Occurrence of Target (Optional)
2.12 Drop Eggs (Optional)
2.13 First Position of Target (Optional)
2.14 K Closest Numbers In Sorted Array (Optional)
2.15 Divide Two Integers (Optional)
2.16 Search For a Range (Optional)
2.17 Search a 2D Matrix II (Optional)
2.18 Classical Binary Search (Related)
2.19 Sqrt(x) (Related)
2.20 Maximum Average Subarray (Related)
2.21 Sqrt(x) II (Related)
2.22 Find Minimum in Rotated Sorted Array II (Related)
2.23 Search in Rotated Sorted Array II (Related)
2.24 Copy Books (Related)
2.25 Wood Cut (Related)
3. Binary Tree & Divide Conquer
3.1 Subtree with Maximum Average
3.2 Minimum Subtree
3.3 Binary Tree Longest Consecutive Sequence
3.4 Binary Tree Path Sum
4. Breadth First Search
5. Depth First Search
6. Linked List & Array
7. Two Points
8. Data Structure
9. Dynamic Programming
10. Others
Powered by
GitBook
1. strStr & Coding style (9)
results matching "
"
No results matching "
"