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 abbff56

Browse files
add one more
1 parent 67905c7 commit abbff56

File tree

1 file changed

+5
-1
lines changed

1 file changed

+5
-1
lines changed

‎Leetcode discussion/2022practice.md

Lines changed: 5 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -365,6 +365,10 @@ April 22, 2022
365365
April 19, 2022
366366
<br>11. Container With Most Water<br>
367367
[C# | Two pointers technique | Time complexity: O(N)](https://leetcode.com/problems/container-with-most-water/discuss/1965157/C-or-Two-pointers-technique-or-Time-complexity%3A-O(N))
368-
368+
369+
June 8, 2022<br>
370+
I came cross this algorithm when I read Leetcode interview discuss panel. I could not understand my own discuss post, so I quickly added one test case, and then added more detail for me to understand the algorithm. <br>
371+
<br>204. Count Primes<br>
372+
[C# as simple as possible](https://leetcode.com/problems/count-primes/discuss/177386/C-as-simple-as-possible)<br>
369373

370374

0 commit comments

Comments
(0)

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