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

I'm really enjoying this book. My skills on algorithms were a little bit rusty since I'm graduated for some time (around 17 years ago). The point is that nowadays you have all of these data structures already built-in inside wherever language you pick (Java, C#, Python...), so this makes you become somehow "lazy" and this is not good after all ... mainly when a complex project arrives on your desk or when you want to join a cool open source project that has several sorts of data structures inside, like the Linux Kernel, without this knowledge you can't basically get in a project of such magnitude. I'll gave 05 stars for this book due to the following: 1. The book is very objective and you don't need to read tons of pages before a practical example. 2. The author explains visually every algorithm what really helps because I'm very used to think "visually". 3. The book has a lot of exercises so once you grasp the concepts you'll be faced with exercises and detailed explanations. 4. The book arms you with knowledge to pick the best data structure, even when your language/library already gives you one. 5. The author maintains a nice website with videos explaining the concepts of the book. 6. Comparing to other data structures books this one is the most practical in my opinion.

I'm torn about my review of this book. I read the book cover to cover over the past few weeks. I also interviewed with both Amazon and Microsoft last week. The pro: I WAS asked questions at both Amazon and Microsoft that are presented in this book. Because of my reading, I knew where to go with the solutions. I was also able to use things I learned in this book to find solutions to questions I was asked that aren't directly discussed in the book. The con: There are SO many formatting/content issues in the book. I would venture to guess that there are 5 - 10 typos/grammar mistakes per page in the book, some so severe that they change the intended meaning of the sentence/example. Additionally, there are at least a few places in the book that the code simply doesn't run due to errors in the code itself. It seems to me that the book would do well to have a native English speaking person proofread it, as well as someone to double check the code samples. I would have absolutely given this book five stars had it not been for the errors. Normally an error or two wouldn't bother me that much, but there are so many of them here that they're extremely difficult to overlook. However, at the end of the day, the content in this book DID help me be prepared for the interviews. So, if you're preparing for an interview and don't mind working through the errors, this is an excellent resource.

The book itself is very good, it is quite dense, it has many examples that help to understand the theory. En estos tiempos hay muchos libros en el mercado y es dificil poder elegir uno perfecto en todos los sentidos. I hope this book help me in my new adventure! One thing that I would really like before buying a book is to be able to read the table of contents and you can hardly ever see it before... so in my reviews I always try to leave photos of the table of contents of books I bought for other future buyers. It came with a slightly wrinkled cover, but I imagine it has to do with transportation.

This book says "the content covers all the required topics in full detail" in its preface, but like some other reviewers have said it is too shallow and not comprehensive enough. Overall, it is definitely not enough for someone learning the topics for the first time and barely arguably enough for someone reviewing it. Examples 1. The solution is presented after the problem with little to no explanation in many of the problems "Find upper bound for f(n) = 3n +8 Solution: 3n + 8 <= 4n, for all n>= 8 [therefore] 3n + 8 = O(n) with c = 4 and n0 = 8 " This is all that is presented, for the reader to know why this solution he has to look back to the theorem presented, then look past the next 5 identical problems and see "No Uniquess"? and read a short explanation about how c and n0 are trivial (essentially putting both together by themselves). 2. "Problem-3 Generate all the strings of n bits. Assume A[0... n-1] is an array of size n" That's all the problem says. What are the string of what bit? What's the output? Likewise, the "solution" is a 6 line function that has only one comment saying A is a global variable and NO explanation at all. 3. The great majority of the problem are in this format, too vague problem, short code snippet solution, little to no explanation. I know the author means well, but what good are solutions if they are not explained? Here's what I recommend instead. http://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358/ref=sr_1_1?ie=UTF8&qid=1465252423&sr=8-1&keywords=algorithm+design http://www.amazon.com/s/ref=nb_sb_ss_c_0_16?url=search-alias%3Daps&field-keywords=algorithm+design+manual&sprefix=algorithm+design%2Caps%2C206&rh=i%3Aaps%2Ck%3Aalgorithm+design+manual Both these books have full lecture slides accompany them, full solution explanations and highly readable without compromising technical detail. I'm not sure what I will be doing with my copy of this book, but if I'm going to invest 100+ hours of studying the book I choose must be of the highest standard.

This is a really good book! It is not a Java book and the code is a mix of Java/C++ and has some typos but these are the only cons. It has clear explanation of concepts and has lots of practical problems with full solutions!It helps a lot to become better in algorithms and data structures.I highly recommend it.

well laid out

It says made easy but it’s not easy, and the font size is too small for such complicated book. I would buy a different book

Good book but there are too many printing errors. Also the Java coding examples often cannot be compiled. They have variable name errors or they are inaccurate. All this despite being a second edition. It would be 5 stars, but only after a serious review.

Nice Book to prepare for interviews and increase you skillset.

You have to zoom in to read contents.