Algorithm study

January 2, 2017

Plan to spend some time to go over the algorithms one by one.

Go over those algorithm first:
K Closest Points
Longest Palindrome
Rectangle Overlap
Window Sum

Copy List with Random Pointer
Five Scores
Maximum Subtree
Minimum Spanning Tree
Order Dependency

Coding Questions:

A

Arithmetic Sequence

B

BST Minimum Path Sum

C

Copy List with Random Pointer

D

Day Change (Cell Growth)

F

Five Scores I
Five Scores II

Four Integer

Find Optimal Weights (Close Two Sum)

G

GCD Greatest Common Divisor

Gray Code

I

Insert Into Cycle Linked List

K

K Closest Points

L

Loop in Linked List
LRU Cache Count Miss

M

Maximum Minimum Path

Maze
Minimum Spanning Tree I
Minimum Spanning Tree II

Merge Two Sorted Lists

Maximum Subtree of Average I
Maximum Subtree of Average II

O

Order Dependency I
Order Dependency II

R

Remove Vowel

Round Robin
Rotate Matrix

Rotate String
Reverse Second Half of Linked List

Rectangle Overlap

S

Same Tree
Subtree Check

Shortest Job First

Sliding Window Maximum(Minimum)

Search a 2D matrix

Search a 2D Matrix II

T

Two Sum Count

Tree Amplitude

V

Valid parentheses

W

Window Sum

Blog reading:
https://segmentfault.com/t/amazon/blogs

Perfect interview