IMPORTANT DATA STRUCTURES FOR GOOGLE INTERVIEWS

https://in.pinterest.com/pin/92886811057157872/

Keep it simple. The following data structures fall into “must know” category:

1. Linked list — Singly and Doubly
2. Stack
3. Queues
4. Binary Search Tree
5. Heaps
6. Basic Graph Traversal and Shortest Path
7. Hashing

You might be asked about the data structures below. Their chance of being asked is between 50 and 75%:

1. Tries
2. Advanced Graphs like flow and min-cut etc.
3. Bit manipulation

With the necessary knowledge from above, you’ll probably ace the interviews.

Following have very low probability of being asked (<25%):

1. Segment Trees/Binary Indexed trees
2. AVL Trees
3. B+ Trees

Other hard data structures are absolutely unnecessary.

Following Algorithms/ Tricks/ Topics may also be important:

1. Memory management
2. Divide and Conquer
3. Dynamic Programming
4. Sorting and Searching

Following topics is important for knowledge/experience based questions:

1. OS — Threads, Processes and Locks using Mutex, Semaphores.
2. Scalability Issues, RPCs, Rate Limiter etc.
3. OOPs Concepts.
4. Databases — SQL, NOSQL, Writing Simple Queries, Transactions, ACID

Also read:

Must known 60+ websites for finding work in every field

PROGRAMMING LANGUAGES TO GET YOU PLACED IN GOOGLE

All the best!