update roadmap: mark 0217 Contains Duplicate as DONE

org/study_deck_02/roadmap.org

@@ -6,9 +6,9 @@
 
 Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
-* TODO Arrays & Hashing [/]
+* TODO Arrays & Hashing [1/12]
 
-** TODO 0217. Contains Duplicate :easy:
+** DONE 0217. Contains Duplicate :easy:
 :PROPERTIES:
 :LEETCODE: [[https://leetcode.com/problems/contains-duplicate/][Problem]]
 :CPP:      [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0217-contains-duplicate.cpp][Solution]]
@@ -16,20 +16,13 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 :VIDEO:    [[https://youtube.com/watch?v=3OamzN90kPg][Watch]]
 :END:
 
-*** TODO Python
+*** DONE Python
-*** TODO C++
+*** DONE C++
 Notes: [[file:dsa/arrays-hashing/0217-contains-duplicate.org]]
 ** TODO 0242. Valid Anagram :easy:
 :PROPERTIES:
-:LEETCODE: [[https://lclass Solution:
+:LEETCODE: [[https://leetcode.com/problems/valid-anagram/][Problem]]
-    def containsDuplicate(self, nums: List[int]) -> bool:
+:CPP:      [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0242-valid-anagram.cpp][Solution]]
-        s = set()
-        for x in nums:
-            if x in s:
-                return True
-            s.add(x)
-        return False
-.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]]
 :END: