A. What You Need to Know B. Interview Questions
Linked Lists 1. Data Structures and Algorithms with JavaScript, Ch. 6 Linked Lists ✓ 2. http://bit.ly/1CyeMOk X 3. http://bit.ly/1GSd4gA X
Binary Trees 1. Data Structures and Algorithms with JavaScript, Ch. 10 Binary Trees ✓ ^^^^^ 2. http://bit.ly/1Cy9LoW X
Tries 1. Javascript Implementation 1: http://bit.ly/1NodIb5 X ^^^^^ 2. Javascript Implementation 2: http://bit.ly/1J9hLS7 X
Stacks 1. Data Structures and Algorithms with JavaScript, Ch. 4 Stacks (ibooks) ✓ 2. http://bit.ly/1Cyc7Eb X
Queues 1. Data Structures and Algorithms with JavaScript, Ch. 5 Queues ✓ 2. http://bit.ly/1NobhFp X 3. http://bit.ly/1Cyc4sa X
Vectors/ArrayLists 1. Data Structures and Algorithms with JavaScript, Ch. 2 Arrays X 2. http://bit.ly/1CydW3X (Array Object) X
Hash Tables 1. Data Structures and Algorithms with JavaScript, Ch. 8 Hashing ✓ 2. http://bit.ly/1az0Gph X 3. http://bit.ly/1CyesPG (Associative Array) X
Breadth First Search 1. Data Structures and Algorithms with JavaScript, Ch. 10 page: 339
^^^^^
Depth First Search 1. Data Structures and Algorithms with JavaScript, Ch. 10 page: 339
^^^^^
Binary Search 1. Data Structures and Algorithms with JavaScript, Ch. 10 & 13 Binary Search
^^^^^
Merge Sort 1. Data Structures and Algorithms with JavaScript, Ch. 12 Sorting Algorithms
^^^^^
Quick Sort 1. Data Structures and Algorithms with JavaScript, Ch. 12 Sorting Algorithms
^^^^^
Tree Insert/Find/etc .
^^^^^
Bit Manipulation .
^^^^^
Singleton Design Pattern .
^^^^^
Factory Design Pattern .
^^^^^
Memory (Stack vs Heap) .
^^^^^
Recursion: 1. Data Structures and Algorithms with JavaScript, Ch. 14 Advanced Algorithms
^^^^^ 2. Recursion linked lists: http://bit.ly/1aoMf6T
Big-O Time: 1. Plain English explanation of Big O: http://bit.ly/1yzK0cE
^^^^^ 2. Video: http://bit.ly/1z1vfKv
Data Structures
Chapter 1 | Arrays and Strings
1.1 Has Unique Chars Algorithm 0
1.2 Reverse String Algorithm 0
1.3 Remove Duplicates Within a String 0
1.4 Two Strings Anagrams 0
1.5 String Replace 0
1.6 Rotate Matrix 90 Degrees 0 HARD YES
1.7 Set Row & Column All to Zero 0 YES
1.8 Is Substring 0
Chapter 2 | Linked Lists
2.1 Remove Duplicates From an Unsorted Linked List 00
2.2 Nth to Last Element in Singly Linked List 0
2.3 Delete Node in Middle of Single Linked List 0
2.4 Add Two Numbers Return Sum as Single Linked List X NEVER FINISHED
2.5 Return Node at Beginning of Circular Linked List
Chapter 3 | Stacks and Queues
3.1 Single Array to Implement Three Stacks
3.2
3.3
3.4
3.5
3.6
Chapter 4 | Trees and Graphs
4.1
4.2
4.3
4.4
4.5
4.6
4.7
4.8
Concepts and Algorithms
Chapter 5 | Bit Manipulation
5.1
5.2
5.3
5.4
5.5
5.6
5.7
Chapter 6 | Brain Teasers
6.1
6.2
6.3
6.4
6.5
6.6
Chapter 7 | Object Oriented Design
7.1
7.2
7.3
7.4
7.5
7.6
7.7
7.8
7.9
7.10
Chapter 8 | Recursion
8.1
8.2
8.3
8.4
8.5
8.6
8.7
8.8
Chapter 9 | Sorting and Searching
9.1
9.2
9.3
9.4
9.5
9.6
9.7
Chapter 10 | Mathematical
10.1
10.2
10.3
10.4
10.5
10.6
10.7
Chapter 11 | Testing
11.1
11.2
11.3
11.4
11.5
11.6
Chapter 12 | System Design and Memory Limits
12.1
12.2
12.3
12.4
12.5
12.6
12.7
Knowledge Based
Chapter 13 | C++
Chapter 14 | Java
Chapter 15 | Databases
Chapter 16 | Low Level
Chapter 17 | Networking
Chapter 18 | Threads and Locks
18.1
18.2
18.3
18.4
18.5
18.6
Additional Review Problems
Chapter 19 | Moderate
Chapter 20 | Hard