list.txt

1. understand closest pair of points
3. implement a queue by using two stacks
4. implement the min function with a stack
6. dequeue with 2 stacks?
8. Warnsdorff's algorithm - knight's tour problem


dynamic programming!!!

- trap water problem --> two pointer implementation
- backtracking algorithm
- review heapsort, quicksort, insertionsort, mergesort
- bubble sort


1. sorting and data structures
- big O notes
- implement trees
	- binary trees
	- red black trees
	- avl tree
4. C based knowledge
5. Dijkstra, topological sort
6. Bit Manipulation and Two's Compliment


1. What is the worst time complexity (noted O) of bubble sort ?
2. Explain what is a BST (Binary Search Tree)?
3. What is the primary advantage of a Linked List ?
4. What is an algorithm ?
5. What is LIFO ?

1. What is a stack ?
2. Define a linear and non-linear data structure (and give one example of each)
3. What is FIFO ?
4. What is the worst time complexity of Mergesort ?
5. Do you know about the TSP ? (Travelling Salesman Problem)

1. What is the big O of Heapsort ?
2. What is the difference between PUSH and POP ?
3. What is the difference between queue and stack data structure ?
4. Explain the difference between little and big endian
5. How do you find out if a number is a power of 2 (multiple answers possible) ?


Monday
1. DFS BST
2. BFS BST
3. Get a correction point
4. learn method for trap water
5. Review Fillit 
6. Deque

Tuesday
1. Red black trees
2. Work on Fillit
3. implement new method for trap water
4. Notes on trees
5. get correction point

Wednesday
1. Rewrite get next line.