How would I apply these to my day-to-day work? (Click to expand)
- As a programmer, we have to solve problems every day. If you want to solve problems well, then it's good to know about a broad range of solutions. A lot of times, it's more efficient to learn existing resources than stumble upon the answer yourself. The more tools and practice you have, the better. This book helps you understand the tradeoffs among data structures and reason about algorithms performance.
+ As a programmer, we have to solve problems every day. If you want to solve problems well, it's good to know about a broad range of solutions. Often, it's more efficient to learn existing resources than stumble upon the answer yourself. The more tools and practice you have, the better. This book helps you understand the tradeoffs among data structures and reason about algorithms performance.
diff --git a/book/content/part02/array.asc b/book/content/part02/array.asc
index 066cbb58..25c029ee 100644
--- a/book/content/part02/array.asc
+++ b/book/content/part02/array.asc
@@ -73,7 +73,7 @@ Here's an example:
[source, javascript]
----
const array = [2, 5, 1];
-array.unshift(0); // ↪️ 8
+array.unshift(0); // ↪️ 4
console.log(array); // [ 0, 2, 5, 1 ]
array.unshift(-2, -1); // ↪️ 6
console.log(array); // [ -2, -1, 0, 2, 5, 1 ]
@@ -522,7 +522,7 @@ maxSubArray([-3, 4,-1, 2, 1, -5]); // 6 (sum [4,-1, 2, 1])
maxSubArray([-2, 1, -3, 4, -1, 3, 1]); // 7 (sum [4,-1, 3, 1])
----
-_Common in interviews at: Amazon, Apple, Google, Microsoft, Facebook_
+_Common in interviews at: FAANG, Microsoft_
// end::array-q-max-subarray[]
[source, javascript]
diff --git a/book/content/part02/hash-map.asc b/book/content/part02/hash-map.asc
index ab5ad56f..8f239cba 100644
--- a/book/content/part02/hash-map.asc
+++ b/book/content/part02/hash-map.asc
@@ -486,7 +486,7 @@ function longestSubstring(s) {
.Examples
[source, javascript]
----
-longestSubstring('abcdaefg'); // 4 ('abcd' or 'aefg')
+longestSubstring('abcdaefg'); // 7 ('bcdaefg')
longestSubstring('abbaa'); // 2 ('ab')
longestSubstring('abbadvdf') // 4 ('badv')
----
@@ -627,7 +627,7 @@ Something that might look unnecessary is the `Math.max` when updating the `lo` p
// end::hashmap-q-two-sum[]
-_Common in interviews at: Amazon, Google, Apple._
+_Common in interviews at: FAANG._
Examples:
@@ -656,7 +656,7 @@ _Solution: <