LintCode面试算法学习笔记
Introduction
1. Java常用数据结构
Java String
Java Generic collections
Java Collections
2. 窗口类型问题 Sliding window
Find All Anagrams in a String
Longest Substring Without Repeating Characters
Minimum Window Substring
Longest substring with At most K Distinct characters
Minimum Size Subarray Sum
3. DFS, Backtracking问题
Subset
Subset II
Permutaion
Permutation II
Combination sum
Combination Sum II
Palindrome Partitioning
Generate Parentheses
Word Search
Factorization
Remove Invalid Parentheses
Word Break II
5. 二分法问题 Binary Search
Closest Number in Sorted Array
Last Position of Target
Find Minimum in Rotated Sorted Array
Search in Rotated Sorted Array
Find Peak Element
Search for a Range
Sqrt(x)
10. 并查集问题 Union Find
Connecting Graph
Connecting-graph-III
Number of Islands II
11. 字典树问题 Trie
Implement Trie
7. 二叉树问题 Binary search tree
Minimum Subtree
Subtree with Maximum Average
Binary Tree Paths
Flatten Binary Tree to Linked List
Maximum Depth of Binary Tree
Balanced binary tree
Validate binary search tree
Lowest Common Ancestor
Lowest Common Ancestor III
Binary Tree Path Sum
Subarray sum equals K
Path Sum III
Binary Tree Path Sum II
Binary Tree Path Sum III
Word Ladder
4. BFS问题
Word Ladder
Powered by
GitBook
Introduction
Questions on lintcode and leetcode.
results matching "
"
No results matching "
"