8000
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 2338d1f commit dffcf2eCopy full SHA for dffcf2e
algorithms/cpp/3Sum/3Sum.cpp
@@ -30,7 +30,7 @@ using namespace std;
30
31
32
/*
33
- * Simlar like "Two Number" problem, we can have the simlar solution.
+ * Similar like "Two Number" problem, we can have the simlar solution.
34
*
35
* Suppose the input array is S[0..n-1], 3SUM can be solved in O(n^2) time on average by
36
* inserting each number S[i] into a hash table, and then for each index i and j,
0 commit comments