Developer Interview Essentials

Java Collections
http://javahungry.blogspot.com/2015/05/50-java-collections-interview-questions-and-answers.html

Data Structures and algorithms
http://javahungry.blogspot.com/p/data-structures-in-java.html

Big O notation cheatsheet
http://bigocheatsheet.com/

Linear and Binary Search (Best Case : Average case:   Worst Case: O(n))

Bubble Sort  (Best Case : Average case:   Worst Case: )

Selection Sort  (Best Case : Average case:   Worst Case: O(n))

Insertion Sort  (Best Case : Average case:   Worst Case: O(n))

Merge sort  (Best Case : Average case:   Worst Case: O(n))

Quick Sort  (Best Case : Average case:   Worst Case: O(n))

Dijkstra's algorithm - Finding the shortest paths between nodes in a graph.

Binary search tree - http://stackoverflow.com/questions/2130416/what-are-the-applications-of-binary-trees

Tree Rotation

Depth-first search (DFS) -  algorithm for traversing or searching tree or graph data structures

Breadth-first search (BFS) -  algorithm for traversing or searching tree or graph data structures
http://stackoverflow.com/questions/3332947/when-is-it-practical-to-use-dfs-vs-bfs

Stack and Queue
https://www.tutorialspoint.com/data_structures_algorithms/stack_algorithm.htm
https://www.tutorialspoint.com/data_structures_algorithms/dsa_queue.htm


References : Extracted from Internet.