Active Threads:
Most Active This Week
Most Active This Month
Most Active This Year
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
A Common-Sense Guide to Data Structures and Algorithms, Second Edition by @jaywengrow:
page 326 - missing param
on the def autocomplete...
New
On page 379, this part of the Dijkstra shortest path code is supposed to determine the next unvisited city to visit based on it being the...
New
Hi, I am trying to convert the ruby code of Quickselect into python and I noticed that I have to add return statements in the if else con...
New
Hi, in page 54, there is a line that begins with “To put it this in a way that would hold true…”. I believe it should read “To put this i...
New
There are two provided implementations for the number_of_paths function. The ‘hardcoded’ version is correct, but the simplified version i...
New
The attached image shows the first paragraph on page 433. Toward the end of the first line, the toggling between serif and sans serif fon...
New
The first complete paragraph on page 428 contains this phrase: “But if we make it to end of the loop…”
The word “the” is missing. The se...
New
Maybe you were just trying to keep the sum_swap code clean and streamlined for ease of reading, but this method didn’t seem as air-tight ...
New
Book: A Common-Sense Guide to Data Structures and Algorithms, Second Edition
Page 320
Function: collectAllWords
Python Version: CPytho...
New
Hi, in page 42, before the line with the result of log of 64 in base 2, there is a line that reads as:
“Because we had to multiply 2 by ...
New
The last paragraph of the “Change the Data Structure” section begins, “Our using of a hash table…”
Better phrasing would be “Our use of ...
New
Hi, I believe the word “remain” in the last line of the second paragraph in page 39 should be replaced by “remains”.
New
@jaywengrow
While reading through the “Greedy Algorithm” section of chapter 20 I saw that after the diagram for the greatest sum being 6...
New
@jaywengrow
I have noticed a mistake regarding the break condition for the insertion sort algorithm.
Currently, the paragraph is as fol...
New
Most Active Last Three Years
Think Again 50% Off Sale »
The theme of this sale is new perspectives on familiar topics.
Enter coupon code ThinkAgain2021 at checkout t...
New
A Common-Sense Guide to Data Structures and Algorithms, Second Edition by Jay Wengrow @jaywengrow
Hi,
I have the paperback version of t...
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
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
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
On page 331, the subtitle says “Code Implementation: Trie Search,” but the section is about insertion, so it should be “Code Implementati...
New
Title: A Common-Sense Guide to Data Structures and Algorithms, Second Edition
Example: Incorrect time complexity (page 55)
Notice the ...
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
At the bottom of page 96, “execute three more steps" should be “TWO more steps.” Even numbers have three steps, odd numbers have one...
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
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
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 co...
New
Title: A Common-Sense Guide to Data Structures and Algorithms, Second Edition by Jay Wengrow @jaywengrow: (chapter7_p.105)
Example: Get...
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
Book Info
Publisher:
Pragmatic Bookshelf
Are you this book's author? To be notified of all posts made about it, sign up an account then click here, then select 'watching' from the bell icon in the top right corner.
Get money off!
The Pragmatic Bookshelf
35% off any eBook
Simply use coupon code "devtalk.com" at checkout. See full details here.
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.
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'll move you from confusion to "Aha, now I get it!"