Coding Interview Questions 3rd Edition

Book Name: Coding Interview Questions 3rd Edition
Author: Narasimha Karumanchi
Publisher: CareerMonk Publ.
ISBN-10: 9788193245200,8193245202
Year: 2012
Pages: 520 pages
Language: English
File size: 41 MB
File format: PDF

Coding Interview Questions 3rd Edition Pdf Book Description:

Please Hold on! I know many people do not read the preface. But I would strongly recommend that you go through the preface of this book at least. The reason for this is that this preface has something different to offer. This book assumes you have some basic knowledge about computer science. The main objective of the book is not to give you the theorems and proofs about Data Structures and Algorithms. I have followed a pattern of improving the problem solutions with different complexities (for each problem, you will find multiple solutions with different, and reduced complexities). Basically, it’s an enumeration of possible solutions. With this approach, even if you get a new question it will show you a way to think about all possible solutions. This book is very useful for interview preparation, competitive exams preparation, and campus interview preparations. As a job seeker if you read the 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 useful for the students of Engineering Degree and Masters during their academic preparations. In all the chapters you will see that more importance has been given to problems and their analysis instead of theory. For each chapter, first you will read about the basic required theory and this will be followed by a section on problem sets. There are approximately 700 algorithmic problems and all of them are with solutions. 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 problems, multiple solutions are provided with different levels of complexities. We start with the 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 algorithm takes and how much memory the algorithm uses.