Coding Interview Questions
by Narasimha Karumanchi
520 pages· 2012· ISBN 9781475293531
About
Table of Contents: goo.gl/mhrm75
Sample Chapter: goo.gl/LOZI2E
Found Issue? goo.gl/lzK72K
Videos: goo.gl/BcHq74
"Coding Interview Questions" is abook that presents interview questions in simple and straightforward manner with aclear-cut explanation. This book will provide an introduction to the basics. Itcomes handy as an interview and exam guide for computer scientists.
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
Note: If you already have "Data Structures and Algorithms Made Easy" no need to buy this.
Discuss Coding Interview Questions with other readers
Join or start a book club for Coding Interview Questions on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Coding Interview Questions?
Sign up free on Readfeed, then browse public clubs or start your own club with Coding Interview Questions as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Coding Interview Questions with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Coding Interview Questions with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.