Important points to get 27% discount for Computer science & IT Freshers/ Lateral interview book “Coding Interview Questions by Narasimha Karumanchi”
Coding Interview Questions by Narasimha Karumanchi is a book that presents interview question and design patterns in simple and straightforward manner with a clear-cut explanation. This book will provide an introduction to the basics. It comes handy as an interview and exam guide for computer scientists.
This book assumes you have some basic knowledge about computer science. Main objective of the book is not to present you all the interview questions. I have followed a pattern of improving the problem solutions with different complexities (for each problem, you observe multiple solutions with different improved complexities in data structure and algorithmic problems). Basically, it is an enumeration of possible solutions. With this approach, even if we get a new question it gives us a way to think about all possible solutions. For all other topics, it will act as refreshment. This book is very much useful for interview preparation, competitive exams preparation and campus preparations.
As a job seeker if you read complete book with good understanding, I am sure you will challenge the interviewers and that is the objective of this book. This book is very much useful for the students of Engineering Degree and Masters during their academic preparations. All the chapters of this book contain theory and their related problems as many as possible. If you read as a student preparing for competition exams for Computer Science or Information Technology, the content of this book covers all the required topics in full details. While writing the book, an intense care has been taken to help students who are preparing for these kinds of exams.
In most the chapters you will see more importance given to problems and analyzing them instead of concentrating more on theory. For each chapter, first you will see the basic required theory and then followed by problems.
For many of the problems, multiple solutions are provided with different complexities. We start with brute force solution and slowly move towards the best solution possible for that problem. For each problem we will try to understand how much time the algorithm is taking and how much memory the algorithm is taking.
Table of Contents:
1: Programming Basics
3: Recursion and Backtracking
4: Linked Lists
8: Priority Queue and Heaps
9: Graph Algorithms
12: Selection Algorithms (Medians)
13: Symbol Tables
15: String Algorithms
16: Algorithms Design Techniques
17: Greedy Algorithms
18: Divide and Conquer Algorithms
19: Dynamic Programming
20: Complexity Classes
21: Design Interview Questions
22: Operating System Concepts
23: Computer Networking Basics
24: Database Concepts
25: Brain Teasers
26: Non-technical Help
27: Miscellaneous Concepts