Skip to content

Commit 0bf83f1

Browse files
authored
Updates a header.
1 parent a7ab5da commit 0bf83f1

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

3Sum and 4Sum/README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@
1313
1414
There are 2 key procedures in solving this algorithm. Sorting the array, and avoiding duplicates.
1515

16-
### Pre-sorting
16+
### Sorting
1717

1818
Sorting your input array allows for powerful assumptions:
1919

@@ -22,7 +22,7 @@ Sorting your input array allows for powerful assumptions:
2222

2323
You'll make use of these two rules to create an efficient algorithm.
2424

25-
#### Avoiding Duplicates
25+
### Avoiding Duplicates
2626

2727
Since you pre-sort the array, duplicates will be adjacent to each other. You just need to skip over duplicates by comparing adjacent values:
2828

0 commit comments

Comments
 (0)