A Common-Sense Guide to Data Structures and Algorithms, Second Edition (Pragmatic Bookshelf)
Most Active This Week
Most Active This Month
Most Active This Year
Please use the following format for the title of this thread:
Title: A Common-Sense Guide to Data Structures and Algorithms, Second Edit...
New
Most Active Last Three Years
@jaywengrow
“What is the maximum number of steps it would take to perform a binary search on an array of size 100,000?”
“To solve this,...
New
@jaywengrow
While reading Chapter 6, I might have spotted a little error in the Insertion Sort Explanation part on page 85, where it say...
New
@jaywengrow
It seems that the delete method presented in this book doesn’t handle one case. This function does nothing if we try to remo...
New
Most Active Over Three Years
A Common-Sense Guide to Data Structures and Algorithms, Second Edition by Jay Wengrow @jaywengrow
Hi,
I have the paperback version of t...
New
Hello! Thanks for the great book.
I was attempting the Trie (chap 17) exercises and for number 4 the solution provided for the autocorre...
New
In the answers for the Chapter 13 exercises, there are several uses of JavaScript’s array.sort() to sort an array of numbers. However, th...
New
A Common-Sense Guide to Data Structures and Algorithms, Second Edition by @jaywengrow:
page 326 - missing param
on the def autocomplete...
New
Hi @jaywengrow,
I think the table of Selection Sort shows wrong Max number of steps.
For example, for N = 5 we sould have:
Comparsion...
New
In the graph on page 41, the arrow leading from O(log n) points to the O(1) function instead of to the O(log n) function.
New
At the bottom of page 96, “execute three more steps" should be “TWO more steps.” Even numbers have three steps, odd numbers have one step...
New
Title: A Common-Sense Guide to Data Structures and Algorithms, Second Edition
Example: Incorrect time complexity (page 55)
Notice the ...
New
On page 331, the subtitle says “Code Implementation: Trie Search,” but the section is about insertion, so it should be “Code Implementati...
New
In chapter 6,
Page 93/438.
"But now, in the best-case scenario, where the two arrays are identical, we only have to perform N compar...
New
At the bottom of page 85, “position that is greater or equal” should be “smaller”. That is, the loop should stop running once it encounte...
New
On page 91, there’s an example of an array intersection function that uses a double equals in its comparison line:
if (firstArray[i] == ...
New
The word “make” is omitted in the phrase “make this magic come alive” in Chapter 20. (more details in the screenshot)
New
Hello,
Can you please check the time complexity of “Count the Ones” on page 102? I got confused. It has 2 loops (outer and inner). Let’s...
New
In the middle of the page is this sentence:
“Once we find the 4, we can delete it one step:”
This should instead read, “Once we find th...
New
Publisher:
Pragmatic Bookshelf
Latest in A Common-Sense Guide to Data Structures and Algorithms, Second Edition
Get money off!
The Pragmatic Bookshelf
35% off any eBook
Use the coupon code "devtalk.com" to get 35% off any eBook published by PragProg!
Filter by Type:
Devtalk Sponsors
Practical resources that improve the lives of professional developers.
We build trusted fault-tolerant systems that scale to billions of users.
Real-time error tracking, performance insights, and observability for devs.
Supporting innovation across the BEAM ecosystem.
We build reliable cloud platforms for business-critical systems.
Develop your skills with books, videos, and courses.
Catch errors, track performance, monitor hosts and more.
Enabling companies to succeed by building software people love.
Courses that move you from confusion to "Aha, now I get it!"
Publishing Linux Magazine, ADMIN, and MakerSpace for 25+ years.