Merge branch 'DaleStudy:main' into main

Author: CodyMan0

.github/workflows/integration.yaml

@@ -0,0 +1,11 @@
+name: 🔄 Integration
+
+on:
+  pull_request:
+
+jobs:
+  linelint:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v4
+      - uses: fernandrone/[email protected]

.linelint.yml

@@ -0,0 +1,18 @@
+# 'true' will fix files
+autofix: false
+
+# list of paths to ignore, uses gitignore syntaxes (executes before any rule)
+ignore:
+  - "*.md"
+
+rules:
+  # checks if file ends in a newline character
+  end-of-file:
+    # set to true to enable this rule
+    enable: true
+
+    # set to true to disable autofix (if enabled globally)
+    disable-autofix: false
+
+    # if true also checks if file ends in a single newline character
+    single-new-line: false

contains-duplicate/0-chan.ts

@@ -0,0 +1,8 @@
+/**
+ * time complexity : O(n)
+ * space complexity : O(n)
+ */
+function containsDuplicate(nums: number[]): boolean {
+    const hasDuplicate = new Set(nums).size !== nums.length;
+    return hasDuplicate;
+};

contains-duplicate/GUMUNYEONG.js

@@ -0,0 +1,14 @@
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var containsDuplicate = function (nums) {
+    const setObj = new Set(nums);
+
+    const diff = !(nums.length === setObj.size);
+
+    return diff;
+};
+
+// TC: O(n)
+// SC: O(n)

contains-duplicate/HC-kang.ts

@@ -0,0 +1,21 @@
+/**
+217. Contains Duplicate
+
+Example 1:
+Input: nums = [1,2,3,1]
+Output: true
+
+Example 2:
+Input: nums = [1,2,3,4]
+Output: false
+
+Example 3:
+Input: nums = [1,1,1,3,3,4,3,2,4,2]
+Output: true
+ */
+
+// Time complexity: O(n)
+// Space complexity: O(n)
+function containsDuplicate(nums: number[]): boolean {
+  return nums.length !== new Set(nums).size;
+}

contains-duplicate/Raft.py

@@ -0,0 +1,12 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        appeared = defaultdict(int)
+        for n in nums:
+            if appeared[n] > 0:
+                return True
+            appeared[n] += 1
+        
+        return False
+# T: O(n)
+# S: O(n)
+

contains-duplicate/dm.py

@@ -0,0 +1,6 @@
+from typing import List
+
+
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(nums) != len(set(nums))

contains-duplicate/f-exuan21.java

@@ -0,0 +1,16 @@
+// time : O(n)
+// space : O(n)
+
+class Solution {
+    public boolean containsDuplicate(int[] nums) {
+        Set<Integer> set = new HashSet<>();
+        for(int i : nums) {
+            if(set.contains(i)) {
+                return true;
+            }
+            set.add(i);
+        }
+        return false;
+    }
+}
+

contains-duplicate/hajunyoo.py

@@ -0,0 +1,7 @@
+class Solution:
+    # Time complexity: O(n)
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        string_len = len(nums)
+        set_len = len(set(nums))
+
+        return string_len != set_len

contains-duplicate/hwanminini.js

@@ -0,0 +1,10 @@
+// 시간복잡도: O(n)
+// 공간복잡도: O(n)
+
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var containsDuplicate = function(nums) {
+    return nums.length !== new Set(nums).size
+};