Getting Back to Work

Since it has been a while since I worked on anything, I will fix this by working everyday for a small amount of time, and keep incrementing that until 8 hours/day.

1 hour/day (not yet started - in progress - finished on )
2 hours/day (not yet started - in progress - finished on )
3 hours/day (not yet started - in progress - finished on )
4 hours/day (not yet started - in progress - finished on )
5 hours/day (not yet started - in progress - finished on )
6 hours/day (not yet started - in progress - finished on )
7 hours/day (not yet started - in progress - finished on )
8 hours/day (not yet started - in progress - finished on )

Design Interview at Google. ARGHHHHHHHHHH.

Final List (review in the 2 days before the interview)

Data Structures:
Iterator
Smart Pointers
Linked List
Doubly Linked List
Queue
Stack
Deque
Hash Table
Heap
Binary Tree
BST
Red-Black Tree
AVL-Tree
B Tree
Priority Queue
Trie
Union-Find
Skip List
Graph
Bloom Filter
Splay Tree
Suffix Tree
Given a binary tree, make it behave as a list.


General (Design):
Search Suggestion of Google Search Engine