From 38a4178e69e698a1b3c0d4452f0cfd58aed5290d Mon Sep 17 00:00:00 2001 From: Adrian Mejia Date: Tue, 1 Dec 2020 19:43:14 -0500 Subject: [PATCH 1/2] fix(book): update company names --- book/content/part02/array.asc | 2 +- book/content/part02/hash-map.asc | 4 ++-- book/content/part02/linked-list.asc | 2 +- book/content/part02/queue.asc | 2 +- book/content/part03/binary-search-tree-traversal.asc | 2 +- book/content/part03/graph-search.asc | 2 +- lab/exercises/10-mixed/integer-to-words.js | 2 +- 7 files changed, 8 insertions(+), 8 deletions(-) diff --git a/book/content/part02/array.asc b/book/content/part02/array.asc index 066cbb58..3bde2929 100644 --- a/book/content/part02/array.asc +++ b/book/content/part02/array.asc @@ -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..dcdf6a20 100644 --- a/book/content/part02/hash-map.asc +++ b/book/content/part02/hash-map.asc @@ -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: <>_ // end::hashmap-q-subarray-sum-equals-k[] -_Common in interviews at: Facebook, Google, Amazon_ +_Common in interviews at: FAANG_ Examples: diff --git a/book/content/part02/linked-list.asc b/book/content/part02/linked-list.asc index bf2ed110..234ca937 100644 --- a/book/content/part02/linked-list.asc +++ b/book/content/part02/linked-list.asc @@ -584,7 +584,7 @@ mergeTwoLists(2->3->4, 1->2); // 1->2->2->3->4 mergeTwoLists(2->3->4,null); // 2->3->4 ---- -_Common in interviews at: Amazon, Adobe, Microsoft, Google_ +_Common in interviews at: FAANG, Adobe, Microsoft_ // end::linkedlist-q-merge-lists[] [source, javascript] diff --git a/book/content/part02/queue.asc b/book/content/part02/queue.asc index a9c0de2e..609b720a 100644 --- a/book/content/part02/queue.asc +++ b/book/content/part02/queue.asc @@ -103,7 +103,7 @@ counter.request(3100); // 1 (last requests was 100 ms ago, > 10ms, so doesn't co counter.request(3105); // 2 (last requests was 5 ms ago, <= 10ms, so it counts) ---- -_Common in interviews at: Google, Bloomberg, Yandex_ +_Common in interviews at: FAANG, Bloomberg, Yandex_ // end::queue-q-recent-counter[] diff --git a/book/content/part03/binary-search-tree-traversal.asc b/book/content/part03/binary-search-tree-traversal.asc index 1b6b5b60..512a6cbe 100644 --- a/book/content/part03/binary-search-tree-traversal.asc +++ b/book/content/part03/binary-search-tree-traversal.asc @@ -105,7 +105,7 @@ Post-order traverval will return `3, 4, 5, 15, 40, 30, 10`. // end::binary-tree-q-diameter-of-binary-tree[] -_Common in interviews at: Facebook, Amazon, Google_ +_Common in interviews at: FAANG_ // Example 1: // [graphviz, tree-diameter-example-1, png] diff --git a/book/content/part03/graph-search.asc b/book/content/part03/graph-search.asc index eda1d6af..af7d5969 100644 --- a/book/content/part03/graph-search.asc +++ b/book/content/part03/graph-search.asc @@ -155,7 +155,7 @@ _Solution: <>_ // end::graph-q-critical-connections-in-a-network[] -_Common in interviews at: Amazon, Google._ +_Common in interviews at: FAANG._ Examples: diff --git a/lab/exercises/10-mixed/integer-to-words.js b/lab/exercises/10-mixed/integer-to-words.js index b550539a..76cf8e87 100644 --- a/lab/exercises/10-mixed/integer-to-words.js +++ b/lab/exercises/10-mixed/integer-to-words.js @@ -10,7 +10,7 @@ const HUNDREDS = new Map([ ]); /** - * You are creating a basic number-to-speech algorithms to use at Google. + * You are creating a basic number-to-speech algorithms to use at search engine company. * The first part is to convert a given number into its text representation. * The 2nd part, is to take that text and synthetize the voice. * We are going to focus on the first part for this exercise. From 96cc1cb332fa97bab9fea594ee4405812ebbfb0b Mon Sep 17 00:00:00 2001 From: semantic-release-bot Date: Wed, 2 Dec 2020 00:47:11 +0000 Subject: [PATCH 2/2] :bookmark: chore(release): 2.7.1 ## [2.7.1](https://github.com/amejiarosario/dsa.js/compare/2.7.0...2.7.1) (2020-12-02) ### Bug Fixes * **book:** update company names ([38a4178](https://github.com/amejiarosario/dsa.js/commit/38a4178e69e698a1b3c0d4452f0cfd58aed5290d)) --- CHANGELOG.md | 7 +++++++ package-lock.json | 2 +- package.json | 2 +- 3 files changed, 9 insertions(+), 2 deletions(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index 9ad80831..0783431a 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,3 +1,10 @@ +## [2.7.1](https://github.com/amejiarosario/dsa.js/compare/2.7.0...2.7.1) (2020-12-02) + + +### Bug Fixes + +* **book:** update company names ([38a4178](https://github.com/amejiarosario/dsa.js/commit/38a4178e69e698a1b3c0d4452f0cfd58aed5290d)) + # [2.7.0](https://github.com/amejiarosario/dsa.js/compare/2.6.0...2.7.0) (2020-10-30) diff --git a/package-lock.json b/package-lock.json index 48d4536e..902c1cab 100644 --- a/package-lock.json +++ b/package-lock.json @@ -1,6 +1,6 @@ { "name": "dsa.js", - "version": "2.7.0", + "version": "2.7.1", "lockfileVersion": 1, "requires": true, "dependencies": { diff --git a/package.json b/package.json index b629b146..d12afbd4 100644 --- a/package.json +++ b/package.json @@ -1,6 +1,6 @@ { "name": "dsa.js", - "version": "2.7.0", + "version": "2.7.1", "description": "Data Structures & Algorithms in JS", "author": "Adrian Mejia (https://adrianmejia.com)", "homepage": "https://github.com/amejiarosario/dsa.js",