Google-Interview-Preparation-Guide

Books and References

Basic data structures and algorithms

1. Programming pearls by Jon Bently
2. The algorithm design manual by Skiena
3. Introduction to algorithms by Cormen
4. Data Structures and algorithms by Robert Lafore

For Technical Preparation

1. Cracking the coding Interview
2. Programming interviews exposed
3. Elements of Programming interview in Java

Online channels and Websites

Limiting the amount of sources. Its better to have couple of hardcopy books and many online sources to complete different questions.

1. MIT open courseware
2. HackerEarth
3. Hackerrank

Before we head into the main details regarding the topics it is highly recommended to practice each and every question, algorithms on paper instead of using an IDE.

Table of contents

1. Sorting Algorithms 1.1. Selection Sort 1.2. Insertions Sort 1.3. Bubble Sort 1.4. Merge Sort 1.5. Quick Sort 1.6. Heap Sort - max heap and Min heap. 1.7. Counting Sort 1.8. Radix sort

2. Time and Space Complexity for sorting Algorithms

3. Data Structures 3.1. Arrays , Multidimensional Arrays 3.2. LinkedList 3.3. Circular LinkedList 3.4. Stacks 3.5. Queues, Priority Queue 3.6. HashTable 3.7. Binary Tree. 3.8. Graphs

4. NP Complete Problems - what does it mean? 4.1. Travelling salesman 4.2. Knapsack Problem

5. Basic Discrete Math Problems, Probability, Counting problems

6. Object Oriented Programming

7. How to test you code, edge cases, Unit test, API calls

8. System design 6.1. Knowledge according to the real value Problems 6.2. Know the distributed Systems 6.3. Firewalls, Load balancers

9. Dizkstra and A* algorithms

10. Recursion solution.

11. Operating Systems 9.1. Processes, semaphores, locks 9.2. Concurrency 9.3. Threads 9.4. Resource allocation 9.5. Context switching 9.6. Scheduling