Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 8a998a6

Browse files
feat(book/hashmap): add code examples and patterns
1 parent dc47b76 commit 8a998a6

16 files changed

+865
-201
lines changed

‎book/D-interview-questions-solutions.asc

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -437,7 +437,8 @@ The complexity of any of the BFS methods or DFS is similar.
437437
:leveloffset: -1
438438

439439
[#hashmap-q-two-sum]
440-
include::content/part03/hashmap.asc[tag=hashmap-q-two-sum]
440+
include::content/part02/hash-map.asc[tag=hashmap-q-two-sum]
441+
// include::content/part03/hashmap.asc[tag=hashmap-q-two-sum]
441442

442443
This simple problem can have many solutions; let's explore some.
443444

@@ -480,7 +481,8 @@ include::interview-questions/two-sum.js[tags=description;solution]
480481

481482

482483
[#hashmap-q-subarray-sum-equals-k]
483-
include::content/part03/hashmap.asc[tag=hashmap-q-subarray-sum-equals-k]
484+
include::content/part02/hash-map.asc[tag=hashmap-q-subarray-sum-equals-k]
485+
// include::content/part03/hashmap.asc[tag=hashmap-q-subarray-sum-equals-k]
484486

485487
This problem has multiple ways to solve it. Let's explore some.
486488

‎book/content/part02/array.asc

Lines changed: 6 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -3,10 +3,11 @@ ifndef::imagesdir[]
33
:codedir: ../../../src
44
endif::[]
55

6+
(((Array))) (((Data Structures, Linear, Array)))
67
[[array]]
7-
=== Array [[array-chap]]
8-
(((Array)))
9-
(((Data Structures, Linear, Array)))
8+
[[array-chap]]
9+
=== Array
10+
1011
Arrays are one of the most used data structures. You probably have used it a lot already. But, are you aware of the runtimes of `push`, `splice`, `shift`, `indexOf`, and other operations? In this chapter, we are going deeper into the most common operations and their runtimes.
1112

1213
==== Array Basics
@@ -300,9 +301,7 @@ To sum up, the time complexity of an array is:
300301

301302
Many programming problems involve manipulating arrays. Here are some patterns that can help you improve your problem-solving skills.
302303

303-
(((Patterns, Two Pointers)))
304-
305-
===== Two Pointers Pattern
304+
===== Two Pointers Pattern (((Patterns, Two Pointers)))
306305

307306
Usually, we use one pointer to navigate each element in an array. However, there are times when having two pointers (left/right, low/high) comes in handy. Let's do some examples.
308307

@@ -371,9 +370,7 @@ These two pointers have a runtime of `O(n)`.
371370

372371
WARNING: This technique only works for sorted arrays. If the array was not sorted, you would have to sort it first or choose another approach.
373372

374-
(((Patterns, Sliding Window Pointers)))
375-
376-
===== Sliding Window Pattern
373+
===== Sliding Window Pattern (((Patterns, Sliding Window))) [[sliding-window-array]]
377374

378375
The sliding window pattern is similar to the two pointers. The difference is that the distance between the left and right pointer is always the same. Also, the numbers don't need to be sorted. Let's do an example!
379376

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /