Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles

by Narasimha Karumanchi

A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy in Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. The book has around 21 chapters and covers Recursion and Backtracking, Linked Lists, Stacks, Queues,Trees, Priority Queue and Heaps, Disjoint Sets ADT, 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, and other Miscellaneous Concepts. Data Structures And Algorithms Made Easy in Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in 2011, and it is coded in Java language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in C/C++. In short, this book offers solutions to various complex data structures and algorithmic problems. What is unique? Our main objective isn't to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities. In other words, we enumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities. Topics  IntroductionRecursion and BacktrackingLinked ListsStacksQueuesTreesPriority Queue and HeapsDisjoint Sets ADTGraph AlgorithmsSortingSearchingSelection Algorithms [Medians]Symbol TablesHashingString AlgorithmsAlgorithms Design TechniquesGreedy AlgorithmsDivide and Conquer AlgorithmsDynamic ProgrammingComplexity ClassesMiscellaneous ConceptsAlso, check out sample chapters and the blog CareerMonk.com

Genres: Programming, Computer Science, Algorithms, Technical, Software, Technology, Computers

970 pages, Kindle Edition

First published September 14, 2011

Reviews

[Mahesh Gupta · Rating 5 out of 5]

read during MTech placement preparation. made to google, goldman sachs interview and cracked linkedin interview. Need not say more about review. :D

there are some factual mistakes but it has a colleciton of problems for everyone.

[Sangam Singh · Rating 4 out of 5]

good

[Bipeen]

good

[Shahrukh Siddiqui · Rating 4 out of 5]

Very good but it has a few mistakes.

[Rejeev Divakaran · Rating 4 out of 5]

Good book for preparing interviews! Lot of good problems and solutions.

[Parasnath · Rating 5 out of 5]

Hi

[Ambarish · Rating 5 out of 5]

Highly recommended for passing your next interview.

[Ankit Keshari · Rating 5 out of 5]

MUST BE IMPORTANT TO READ

[JkhxvluiJK]

excited

[Naman Agrawal]

looking forward to master data structures and algorithms for internship interview preparation.

[Shivakumar · Rating 4 out of 5]

Its very good book

[Gourav Agrawal]

I want to read this book I have heard about it that this is very good book