We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a7ab5da commit 0bf83f1Copy full SHA for 0bf83f1
3Sum and 4Sum/README.md
@@ -13,7 +13,7 @@
13
14
There are 2 key procedures in solving this algorithm. Sorting the array, and avoiding duplicates.
15
16
-### Pre-sorting
+### Sorting
17
18
Sorting your input array allows for powerful assumptions:
19
@@ -22,7 +22,7 @@ Sorting your input array allows for powerful assumptions:
22
23
You'll make use of these two rules to create an efficient algorithm.
24
25
-#### Avoiding Duplicates
+### Avoiding Duplicates
26
27
Since you pre-sort the array, duplicates will be adjacent to each other. You just need to skip over duplicates by comparing adjacent values:
28
0 commit comments