## Absolute Must Have

Below are must have topics that you must know:

Algorithms | Data Structures | Concepts |
---|---|---|

Breadth First Search (BFS) | Linked Lists | Bit Manipulation |

Depth First Search (DFS) | Binary Trees | Single Design Pattern |

Binary Search | Tries | Factory Design pattern |

Merge Sort | Stacks | Memory (Heap, Stack) |

Quick Sort | Queues | Recursion |

Trees Insert, find, delete etc | ArrayList, Vectors | Complexity, Big-O Notation |

Hash Table |

## Table of Power of 2

This table will be helpful in remembering the units, specially in scalability interviews.

Power off 2 | Value | Value Name | MB, GB,... |
---|---|---|---|

6 | 64 | ||

7 | 128 | ||

8 | 256 | ||

10 | 1024 | One Thousand | 1 KB |

16 | 65,536 | 64 KB | |

20 | 1048,536 | 1 million | 1 MB |

30 | 1073,741,824 | 1 billion | 1 GB |

32 | 4294,967,296 | 4 GB | |

40 | 1099,511,627,776 | 1 trillion | 1 TB |