English | 2017 | ISBN: 1976503306 | 562 Pages | EPUB, AZW3, PDF (conv) | 12 MB
This book is designed for interviews so in Chapter 0, various preparation plans are proposed.
Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained.
Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques.
Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs.
Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking.
In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview.