Problem Solving in Data Structures & Algorithms Using C: The Ultimate Guide to Programming Interviews
This book is about the usage of data structures and Algorithms in computer programming. Designing an efficient algorithm to solve a computer Science problem is a skill of Computer programmer. This is the skill which tech Companies like Google, Amazon, Microsoft, Adobe and many others are looking for in an interview. Once we are comfortable with a Programming language the next step is to learn how to write efficient algorithms. This book assumes that you are a C language developer. You are not an expert in C language, but you are well familiar with concepts of pointers, functions, arrays and recursion. In the start of this book, we will be revising the C language fundamentals that will be used throughout this book. We will be looking into some of the problems in arrays and recursion too. Then in the coming chapter, we will be looking into complexity analysis. 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. We will be looking into sorting, searching techniques. Then we will be looking into algorithm analysis, we will be looking into brute force algorithms, greedy algorithms, divide and conquer algorithms, dynamic programming, reduction and back tracking. In the end, we will be looking into system Design which will give a systematic approach for solving the Design problems in an Interview.