algorithm summary
Introduction
2 Binary Search
Find Peak Element
Find Peak Element 2
First Bad Version
Search in Rotated Sorted Array
Sqrt(x)
Split Array Largest Sum
3 Tree and Divide and Conquer
3.1 Traversal (Recursion && Non-recursion)
Inorder traversal non-recursion
Binary Search Tree Iterator
Inorder Successor in BST
3.2 Divide and Conquer
Lowest Common Ancestor of A BST
binary tree path
33 Valid Binary Search Tree
Lowest Common Ancestor of A Binary Tree
Sum of Left Leaves
Binary Tree Vertical Order Traversal
3.3 BFS in Tree
Binary Tree Level Order Traversal
Populating Next Right Pointers in Each Node II
4 Dynamic Programming
4.1 坐标型DP
Maximal Square
Paint House II
Decode Ways
4.2 单序列型DP
Word_Break
Decode ways
4.3 双序列型DP
Regular Expression Matching
Wildcard Matching
4.4 区间类DP
Stone Game
burst ballons
4.5背包类DP
BackPack 1
BackPack 2
BackPack 3
BackPack 4
BackPack 5
BackPack 6
K SUM
Combination Sum 4
滚动数组优化
House Robber
Maximal Square
Maximal Rectangle
记忆化搜索 与 博弈类DP
Longest Continuous Increasing Subsequence 2D
Coins In A Line 1
Coins In A Line 2
Coins In A Line 3
5 Two Pointers
5.1 Two Sum类
2 Sum
3 Sum
4 Sum
K Sum
2 Sum Closet
3 Sum Closet
Triangle Count
Trapping Rain Water
Containing With Most Water
Find the celebrity
5.2 Partition类
Partition Array
Sort Color
Partition Array By Odd and Even
Sort Letter By Case
Quick Sort
Quick Select
Nuts Bolts Problem
Wiggle Sort 2@
5.3 Window
Minimum Size Subarray Sum
Largest Substring Without Repeating Char
Minimum Window Substring
Largest Substring with at most k different char
5.4 快慢指针 && 两个数组 && Others
Find the Middle of Link List
Link List Cycle
Link List Cycle 2
The Smallest Difference
Merge Two Sorted List
Is Subsequence
5.5 Others
Move Zeros
Remove Nth node from the end of list
6 Linked List
Linked List Palindrome
merge K sorted list
reverse node in k group
LRU Cache
7 Array
7.1 Sorted Array
Median of Sorted Array
remove duplicates from sorted array
remove duplicates from sorted array 2
merge sorted array
7.2 SubArray
7.2.1 Maximum Subarray
Minimum Subarray
Maximum Subarray
Subarray Sum
Subarray Sum 2
Sub Matrix Sum
Continuous Subarray Sum
Continuous Subarray Sum 2
Maximum Size Subarray Sum Equals k
7.2.2 Best time to buy sell stock
best time to buy sell stock 2
best time to buy sell stock
7.3 Sorting
wiggle sort
wiggle sort 2
7.4 Others
Product of Array Except Self
Random Pick Index
Increasing Triplet Subsequence
8 Data Structure
8.1 Stack
Largest Rectangle in Histrogram
Maximal Rectangle
8.2 Union Find
Find the Connected Component in the Undirected Graph
Find the weak connected component in the directed graph
number of islands
number of islands 2
minimum spanning tree
graph valid tree
Connecting Graph 2
8.3 Trie
Implement Trie
Add and Search Word
8.4 Hash
insert delete get random 1
Longest Palindrome
9 Heap
Hash Heap
hash heap template
sliding window median
building outline
sliding window maximum
Trapping Rain Water
Trapping Rain Water 2
data stream median
heapify
heap sort
ugly number
10 Search
10.1 DFS
word search
subset
subset 2
number of island
Letter Combinations of a Phone Number
Target Sum
Memory DFS Search
Longest Increasing Continuous subsequence II
Expression Add Operators
10.2 BFS
Word Ladder
clone graph
course schedule 2
Walls and Gates
Remove Invalid Parentheses
Alien Dictionary
是
11 Sweep Line
Meeting Rooms
Meeting Room 2
Skyline Problem
Merge Interval
Insert Interval
14 Math
Trailing zero in factorial
digit count
Sparse Matrix Multiplication
15 String Operation
rotate string
anagrams
Add Binary
Valid Palindrome
Serialize and Deserialize Binary Tree
One Edit Distance
roman to integer
Implement strStr
multiply string
group anagram
count and say
Excel Sheet Column Title
16 Integer Operation
pow(x, n)
Integer to English Words
17 Char operation
Read N character given read4
Read N characters given read4 2
18 Bit Manipulation
Hamming Distance
Total Hamming Distance
21 Multi Threading
SimPY
Basic Concept
Process Interaction
Share Resource
Reader Writer Problem
Classic Reader Writer Problem
Timestamp Approach
22 Operating System
读文件 统计单词个数
23 Artificial Intelligence
2 Uninformed Search
3-4 Informed Search
5 Constraint Satisfaction Problems
6 Constraint Satisfaction Problem 2
7 Adversarial Search
8 Expectimax
9 Markov Decision Processes 1
10 Markov Decision Processes 2
11 Reinforcement Learning 1
12 Reinforcement Learning 2
13 Probability
14 Markov Models
15 Hidden Markov Models
16 Particle Filters \/ Application of HMMs
17 Bayes Nets 1
18 Bayes Nets 2
19 Decision Diagrams \/ VPI
20 Artificial Neural Networks
24 Database
NoSQL
Final Exam Review
project1
Functional Dependency
Relational Algebra
SQL
Transaction Process
Concurrency Control
25 System Security
13 Stack Buffer Overflows
15 Controlling Addresses and shell code
17 No-stack-execute and ASLR return-to-X method
18 ASLR & NX mitigation
19 Fuzzing and Fuzzers
20 Detecting and Exploring binaries
21 Working with intrusion Detection System
HW4
26 Probability
Basic Concept
Independence
31 Amazon
Amazon OA
Amazon OA1
Amazon OA2
Longest Palindrome
Longest Palindromic Substring
Window Sum
Overlap Rectangle
K Nearest Point
每人最高5个分数的平均数
Deep Copy
Company Tree
order dependency
mst
work simulation
rotate image
search a 2D matrix
valid parentheses
rotate string \/ array
search in a 2D matrix 2
Same Tree
minimum path sum
Remove Vowel
Find Optimal Weights
Onsite
面经1
面经2
32 Facebook
电面
minimum depth of binary tree
binary tree vertical order traversal
F电面面经
F电面面经1
33 Linkedin
面经
L面经1
34 Google
phone interview
Interval Overlap
Interval
onsite
制作新array
Binary Search in unsorted array
Fair coin
Count of Smaller Numbers After Self
给一组xy坐标点，找出四个点使得它们组成的长方形面积最小
onsite 面经
G面经1
G面经2
G面经3
G面经4
G面经5
G面经6
41 OOD
继承 接口 虚函数 纯虚函数
51 WebProgramming
D3 NBA
Powered by
GitBook
19 Decision Diagrams \/ VPI
19 Decision Diagrams / VPI
Choose the action which maximizes the expected utility given the evidence
Decision Network
Value of Information
#
results matching "
"
No results matching "
"