Skip to content

fix(book): update company names#95

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Dec 2, 2020
Merged

fix(book): update company names #95

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion book/content/part02/array.asc
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -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]
Expand Down
4 changes: 2 additions & 2 deletions book/content/part02/hash-map.asc
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -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:

Expand DownExpand Up@@ -656,7 +656,7 @@ _Solution: <<hashmap-q-two-sum>>_

// end::hashmap-q-subarray-sum-equals-k[]

_Common in interviews at: Facebook, Google, Amazon_
_Common in interviews at: FAANG_

Examples:

Expand Down
2 changes: 1 addition & 1 deletion book/content/part02/linked-list.asc
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -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]
Expand Down
2 changes: 1 addition & 1 deletion book/content/part02/queue.asc
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -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[]


Expand Down
2 changes: 1 addition & 1 deletion book/content/part03/binary-search-tree-traversal.asc
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -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]
Expand Down
2 changes: 1 addition & 1 deletion book/content/part03/graph-search.asc
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -155,7 +155,7 @@ _Solution: <<graph-q-course-schedule>>_

// end::graph-q-critical-connections-in-a-network[]

_Common in interviews at: Amazon, Google._
_Common in interviews at: FAANG._

Examples:

Expand Down
2 changes: 1 addition & 1 deletion lab/exercises/10-mixed/integer-to-words.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -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.
Expand Down
close