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 Liar666 (talk | contribs) at 10:40, 21 February 2017 (Cracking the Coding Interview). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.


Cracking the Coding Interview

Basic Knowledge

Architecture
Front_and_back_office_application
Front_and_back_ends
Model–view–controller
Unified_Modeling_Language
Microservices
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
Search algorithm
A* search algorithm
Recursion (computer science)
Dynamic programming
Trees
Tree traversal
Breadth-first search
Depth-first search
Sorting
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
Stack-based memory allocation
Call stack
Complexity
Time complexity
NP_(complexity)
Languages/Frameworks - JavaScript
Comparison_of_JavaScript_frameworks
AngularJS
Backbone.js
Dojo_Toolkit
Ember.js
Google_Web_Toolkit
JQuery
MooTools
Prototype_JavaScript_Framework
SproutCore
Unified.js
Vue.js
Languages/Frameworks - Java
Versioning
Online Java IDE (for testing candidates)
Online Testing platforms
Google Interview