contains-duplicate solution

Author: juhui-jeong

contains-duplicate/juhui-jeong.ts

@@ -0,0 +1,16 @@
+/*
+시간 복잡도: O(n)
+공간 복잡도: O(n)
+*/
+function containsDuplicate(nums: number[]): boolean {
+  const seen = new Set<number>();
+
+  for (const num of nums) {
+    if (seen.has(num)) {
+      return true;
+    }
+    seen.add(num);
+  }
+
+  return false;
+}