What do you think?
Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles
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
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
970 pages, Kindle Edition
First published September 14, 2011
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 12 of 12 reviews
September 1, 2014
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.
there are some factual mistakes but it has a colleciton of problems for everyone.
June 10, 2018
good
This entire review has been hidden because of spoilers.
Want to Read
March 14, 2017good
December 20, 2016
Very good but it has a few mistakes.
April 18, 2012
Good book for preparing interviews! Lot of good problems and solutions.
January 9, 2014
Highly recommended for passing your next interview.
February 23, 2015
MUST BE IMPORTANT TO READ
Currently Reading
December 5, 2015excited
Read
November 18, 2016looking forward to master data structures and algorithms for internship interview preparation.
This entire review has been hidden because of spoilers.
January 9, 2017
Its very good book
Read
June 27, 2014I want to read this book I have heard about it that this is very good book
Displaying 1 - 12 of 12 reviews