upd
This commit is contained in:
@@ -6,7 +6,7 @@
|
||||
|
||||
Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
|
||||
|
||||
* TODO Arrays & Hashing [1/12]
|
||||
* TODO Arrays & Hashing [2/12]
|
||||
|
||||
** DONE 0217. Contains Duplicate :easy:
|
||||
:PROPERTIES:
|
||||
@@ -19,16 +19,18 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
|
||||
*** DONE Python
|
||||
*** DONE C++
|
||||
Notes: [[file:dsa/arrays-hashing/0217-contains-duplicate.org]]
|
||||
** TODO 0242. Valid Anagram :easy:
|
||||
** DONE 0242. Valid Anagram :easy:
|
||||
:PROPERTIES:
|
||||
:LEETCODE: [[https://leetcode.com/problems/valid-anagram/][Problem]]
|
||||
:CPP: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0242-valid-anagram.cpp][Solution]]
|
||||
:PYTHON: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0242-valid-anagram.py][Solution]]
|
||||
:VIDEO: [[https://youtube.com/watch?v=9UtInBqnCgA][Watch]]
|
||||
:RELATED: [[https://leetcode.com/problems/group-anagrams/][049. Group Anagrams]], [[https://leetcode.com/problems/ransom-note/][383. Ransom Note]], [[https://leetcode.com/problems/first-unique-character-in-a-string/][387. First Unique Character]]
|
||||
:TRICK: [[file:toolkit/tricks.org::*Task: Count character frequencies faster than map][Count char freq faster than map]]
|
||||
:END:
|
||||
|
||||
*** TODO Python
|
||||
*** TODO C++
|
||||
*** DONE Python
|
||||
*** DONE C++
|
||||
Notes: [[file:dsa/arrays-hashing/0242-valid-anagram.org]]
|
||||
** TODO 2678. Number of Senior Citizens :easy:
|
||||
:PROPERTIES:
|
||||
|
||||
Reference in New Issue
Block a user