Please enable JavaScript.
Coggle requires JavaScript to display documents.
Cracking the Coding Interview - Coggle Diagram
Cracking the Coding Interview
Introduction
Behavioral Preparation
Big O
Before the Interview
Technical Questions (+ 5 Algorithm Approaches)
Special Situations
The Offer and Beyond
Behind the Scenes
The Interview Process
Introduction
My Approach
Something's Wrong
My Passion
CareerCup.com
https://www.crackingthecodinginterview.com/
https://www.crackingthecodinginterview.com/solutions.html
https://github.com/careercup/CtCI-6th-Edition
Data Structures
Ch 3: Stacks and Queues
Ch 2: Linked Lists
Ch 4: Trees and Graphs
Ch 1: Arrays and Strings
Concepts and Algorithms
Ch 8: Recursion and Dynamic Programming
Ch 9: System Design and Scalability
Ch 7: Object-Oriented Design
Ch 10: Sorting and Searching
Ch 6: Math and Logic Puzzles
Ch 11: Testing
Ch 5: Bit Manipulation
Knowledge Based Interview Questions
Ch 13: Java
Ch 14: Databases
Ch 12: C and C++
Ch 15: Threads and Locks
Advanced Topics
Rabin-Karp Substring Search
AVL Trees
Hash Table Collision Resolution
Red-Black Trees
Dijkstra's Algorithm
MapReduce
Topological Sort
Additional Studying
Useful Math
Code Library
TreeNode (Binary Search Tree)
LinkedListNode (Linked List)
HashMapList<T,E>
Trie & TrieNode
All cod for the book can be downloaded from Cracking
Additional Review Problems
Ch 16: Assorted Moderate Problems
Ch 17: Assorted Hard Problems