What do you think?
Rate this book
Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles
Peeling Data Structures and "Data Structures And Algorithms Made Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.
Topics
Topics
- GenresTechnologyAlgorithms
415 pages, Paperback
Published August 28, 2016
20 people are currently reading
206 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 4 of 4 reviews
June 27, 2021
Some parts of this book were plagiarized from the C/C++ Users Journal (and, maybe, other sources).
Just one example.
Yogi Dandass, C/C++ Users Journal, Volume 18, published in 2000:
"An array-based storage scheme (possibly implemented using an STL vector container) and a brute-force search through the entire database is acceptable only if a single extraction is to be performed or if the number of elements is small. For example, if you know all the temperature values of interest in advance, you need to make only one pass through the array. However, if you can interactively specify different temperature values at different times, the brute-force search technique becomes impractical because every element in the array must be examined during each extraction operation."
This book's author, published in 2016:
"An array-based storage scheme and a brute-force search through the entire array is acceptable only if a single search is to be performed, or if the number of elements is small. For example, if you know all the array values of interest in advance, you need to make only one pass through the array. However, if you can interactively specify different search operations at different times, the brute-force search becomes impractical because every element in the array must be examined during each search operation."
Shame on that guy!
Just one example.
Yogi Dandass, C/C++ Users Journal, Volume 18, published in 2000:
"An array-based storage scheme (possibly implemented using an STL vector container) and a brute-force search through the entire database is acceptable only if a single extraction is to be performed or if the number of elements is small. For example, if you know all the temperature values of interest in advance, you need to make only one pass through the array. However, if you can interactively specify different temperature values at different times, the brute-force search technique becomes impractical because every element in the array must be examined during each extraction operation."
This book's author, published in 2016:
"An array-based storage scheme and a brute-force search through the entire array is acceptable only if a single search is to be performed, or if the number of elements is small. For example, if you know all the array values of interest in advance, you need to make only one pass through the array. However, if you can interactively specify different search operations at different times, the brute-force search becomes impractical because every element in the array must be examined during each search operation."
Shame on that guy!
January 4, 2020
A great book but not for beginners. It would have got more stars if the codes in the graphs section would be working code and not just algorithm. I had a difficult time learning how to convert them into code.
April 7, 2022
below average explanation and most of the code has error. This book is not recommand for complete
starters in dsa(data structures and algorithms) . It also has grammer errors worst book I have ever read in my life .I am giving 2 star because 2 or 3 of the chapters has average explanation.
starters in dsa(data structures and algorithms) . It also has grammer errors worst book I have ever read in my life .I am giving 2 star because 2 or 3 of the chapters has average explanation.
June 24, 2020
Some parts are quite nice, like DP and Greedy Algorithms, but some parts are just really awful to get through. I think for interview prep, EPI is better.
Displaying 1 - 4 of 4 reviews