To All Hard Working Job Hunters
Copyright ©           by                                          All rights reserved.                             Designe...
AcknowledgementsI would like to express my gratitude to many people who saw me through this book, to all those who provide...
PrefaceDear Reader,Please Hold on! I know many people do not read preface. But I would like to strongly recommend readingp...
Table of ContentsProgramming Basics ------------------------------------------------------------------------------9Introdu...
CODING INTERVIEW QUESTIONSOther Titles by         Success keys for Big Job HuntersData Structures and Algorithms Made Easy...
Coding interview questions
Coding interview questions
Upcoming SlideShare
Loading in …5
×

Coding interview questions

1,026 views

Published on

"Coding Interview Questions" is a book that presents 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.
Programming puzzles for interviews
Campus Preparation
Degree/Masters Course Preparation
Big job hunters: Microsoft, Google, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Webaroo, De-Shaw, Success Factors, Face book, McAfee and many more
Reference Manual for working people
Topics Covered:
Programming Basics
Introduction
Recursion and Backtracking
Linked Lists
Stacks
Queues
Trees
Priority Queue and Heaps
Graph Algorithms
Sorting
Searching
Selection Algorithms [Medians]
Symbol Tables
Hashing
String Algorithms
Algorithms Design Techniques
Greedy Algorithms
Divide and Conquer Algorithms
Dynamic Programming
Complexity Classes
Design Interview Questions
Operating System Concepts
Computer Networking Basics
Database Concepts
Brain Teasers
NonTechnical Help
Miscellaneous Concepts

Published in: Education, Technology
  • Be the first to comment

  • Be the first to like this

Coding interview questions

  1. 1. To All Hard Working Job Hunters
  2. 2. Copyright © by All rights reserved. Designed byCopyright ©2012 Career Monk Publications. All rights reserved.All rights reserved. No part of this book may be reproduced in any form or by any electronic or mechanicalmeans, including information storage and retrieval systems, without written permission from the publisher orauthor
  3. 3. AcknowledgementsI would like to express my gratitude to many people who saw me through this book, to all those who providedsupport, talked things over, read, wrote, offered comments, allowed me to quote their remarks and assisted inthe editing, proofreading and design. In particular, I would like to thank the following individuals. [ ], for his encouragement during my stay at . [ ], [ , ] forspending their valuable time in reviewing the book, suggestions and encouragement. & [Founders of ], for approaching me for teaching at their training centers. , and have contributed greatly to the quality of this book. I thank all offor your help and suggestions.Last but not least, I would like to thank of , & [ ], [ of ], [ , ],[ ], [ , ]& for helping me andmy family during our studies. - M-Tech, Founder of
  4. 4. PrefaceDear Reader,Please Hold on! I know many people do not read preface. But I would like to strongly recommend readingpreface of this book at least. This preface has from regular prefaces.This book assumes you have some basic knowledge about computer science. Main objective of the book is not toprovide you all the interview questions. I have followed a pattern of improving the problem solutions withdifferent complexities (for each problem, you observe multiple solutions with different improved complexitiesin data structure and algorithmic problems). Basically, it is an enumeration of possible solutions. With thisapproach, even if we get a new question it gives us a way to think about all possible solutions. For all othertopics, it will act as refreshment. This book is very much useful for interview preparation, competitive examspreparation and campus preparations.As a if you read complete book with good understanding, I am sure you will challenge theinterviewers and that is the objective of this book.This book is very much useful for the of and during their academicpreparations. All the chapters of this book contain theory and their related problems as many as possible. If youread as a preparing for competition exams for Computer Science/Information Technology], the contentof this book covers the topics in full details. While writing the book, an intense care has beentaken to help students who are preparing for these kinds of exams.In most the chapters you will see more importance given to and analyzing them instead ofconcentrating more on theory. For each chapter, first you will see the basic required theory and then followedby problems.For many of the problems, solutions are provided with different complexities. We start with solution and slowly move towards the possible for that problem. For each problemwe will try to understand how much time the algorithm is taking and how much memory the algorithm istaking.It is that, at least one complete reading of this book is required to get full understanding of allthe topics. In the subsequent readings, you can directly go to any chapter and refer. Even though, enoughreadings were given for correcting the errors, due to human tendency there could be some minor typos in thebook. If any such typos found, they will be updated at . I request you to constantlymonitor this site for any corrections, new problems and solutions. Also, please provide your valuablesuggestions at: . Wish you all the best. Have a nice reading. - M-Tech, Founder of
  5. 5. Table of ContentsProgramming Basics ------------------------------------------------------------------------------9Introduction ------------------------------------------------------------------------------------- 39Recursion and Backtracking -------------------------------------------------------------------- 58Linked Lists ------------------------------------------------------------------------------------- 63Stacks -------------------------------------------------------------------------------------------- 99Queues------------------------------------------------------------------------------------------ 122Trees -------------------------------------------------------------------------------------------- 132Priority Queue and Heaps --------------------------------------------------------------------- 202Graph Algorithms ------------------------------------------------------------------------------ 218Sorting ------------------------------------------------------------------------------------------ 246Searching --------------------------------------------------------------------------------------- 266Selection Algorithms [Medians] --------------------------------------------------------------- 291Symbol Tables ---------------------------------------------------------------------------------- 300Hashing ---------------------------------------------------------------------------------------- 302String Algorithms ----------------------------------------------------------------------------- 316Algorithms Design Techniques ---------------------------------------------------------------- 337Greedy Algorithms----------------------------------------------------------------------------- 340Divide and Conquer Algorithms -------------------------------------------------------------- 349Dynamic Programming ----------------------------------------------------------------------- 355Complexity Classes----------------------------------------------------------------------------- 392Design Interview Questions ------------------------------------------------------------------- 398Operating System Concepts ------------------------------------------------------------------- 454Computer Networking Basics------------------------------------------------------------------ 461Database Concepts ----------------------------------------------------------------------------- 474Brain Teasers ----------------------------------------------------------------------------------- 480Non-Technical Help --------------------------------------------------------------------------- 483Miscellaneous Concepts ----------------------------------------------------------------------- 488
  6. 6. CODING INTERVIEW QUESTIONSOther Titles by Success keys for Big Job HuntersData Structures and Algorithms Made EasyData Structures and Algorithms Made Easy in JavaData Structures and Algorithms for GATEDesign Interview Questions

×