Jump to content

User:LI AR/Books/Cracking the Coding Interview

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by LI AR (talk | contribs) at 13:38, 31 January 2017 (Created page with '{{saved book |title= |subtitle= |cover-image= |cover-color= | setting-papersize = a4 | setting-toc = yes | setting-columns = 1 }} == Cracking the Coding...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


Cracking the Coding Interview

Basic Knowledge

DataStructure
Data structure
Linked list
Queue (abstract data type)
Stack (abstract data type)
Pile (abstract data type)
Hash table
Tree (data structure)
Trie
Graph (abstract data type)
Graph theory
Algos
Dijkstra's algorithm
A* search algorithm
Dynamic programming
Trees
Tree traversal
Breadth-first search
Depth-first search
Sorting
Search algorithm
Merge sort
Quicksort
Binary search algorithm
Testing
JUnit
Unit testing
Regression testing
Threading
Thread (computing)
Lock (computer science)
Mutual exclusion
Semaphore (programming)
Memory Management
Memory management
Call stack
Complexity
Time complexity