From 8b2a04541b79a71936bf7be0d54084776ff69178 Mon Sep 17 00:00:00 2001
From: yhkee0404 <yhkee0404@gmail.com>
Date: Mon, 28 Jul 2025 07:35:42 +0900
Subject: [PATCH 1/5] contains duplicate solution

---
 contains-duplicate/yhkee0404.kt | 6 ++++++
 1 file changed, 6 insertions(+)
 create mode 100644 contains-duplicate/yhkee0404.kt

diff --git a/contains-duplicate/yhkee0404.kt b/contains-duplicate/yhkee0404.kt
new file mode 100644
index 000000000..0e8b6cc12
--- /dev/null
+++ b/contains-duplicate/yhkee0404.kt
@@ -0,0 +1,6 @@
+class Solution {
+    fun containsDuplicate(nums: IntArray): Boolean {
+        return nums.toSet()
+                .size != nums.size
+    }
+}

From aa011def5fe7ae98bbf2198fbbafba2a3a0c8c43 Mon Sep 17 00:00:00 2001
From: yhkee0404 <yhkee0404@gmail.com>
Date: Mon, 28 Jul 2025 07:36:33 +0900
Subject: [PATCH 2/5] two sum solution

---
 two-sum/yhkee0404.go | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 two-sum/yhkee0404.go

diff --git a/two-sum/yhkee0404.go b/two-sum/yhkee0404.go
new file mode 100644
index 000000000..f223dc396
--- /dev/null
+++ b/two-sum/yhkee0404.go
@@ -0,0 +1,11 @@
+func twoSum(nums []int, target int) []int {
+    indices := make(map[int]int)
+    for i, num := range nums {
+        j, ok := indices[target - num]
+        if ok {
+            return []int{j, i}
+        }
+        indices[num] = i
+    }
+    return []int{}
+}

From 5575f5f4815109cfa1a145cb2002ab672d0ac675 Mon Sep 17 00:00:00 2001
From: yhkee0404 <yhkee0404@gmail.com>
Date: Mon, 28 Jul 2025 07:38:19 +0900
Subject: [PATCH 3/5] top k frequent elements solution

---
 top-k-frequent-elements/yhkee0404.scala | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 top-k-frequent-elements/yhkee0404.scala

diff --git a/top-k-frequent-elements/yhkee0404.scala b/top-k-frequent-elements/yhkee0404.scala
new file mode 100644
index 000000000..06fa6a9c8
--- /dev/null
+++ b/top-k-frequent-elements/yhkee0404.scala
@@ -0,0 +1,11 @@
+object Solution {
+    def topKFrequent(nums: Array[Int], k: Int): Array[Int] = {
+        return nums.groupBy(identity)
+                .view.mapValues(_.size)
+                .toSeq
+                .sortBy(- _._2)
+                .take(k)
+                .map(_._1)
+                .toArray
+    }
+}

From 3561a31324b4e1938dd2ffc858e49a50b8fb9996 Mon Sep 17 00:00:00 2001
From: yhkee0404 <yhkee0404@gmail.com>
Date: Mon, 28 Jul 2025 07:39:05 +0900
Subject: [PATCH 4/5] longest consecutive sequence solution

---
 longest-consecutive-sequence/yhkee0404.go | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 longest-consecutive-sequence/yhkee0404.go

diff --git a/longest-consecutive-sequence/yhkee0404.go b/longest-consecutive-sequence/yhkee0404.go
new file mode 100644
index 000000000..95e261ee1
--- /dev/null
+++ b/longest-consecutive-sequence/yhkee0404.go
@@ -0,0 +1,22 @@
+func longestConsecutive(nums []int) int {
+    ans := 0
+    sort.Ints(nums)
+    i := 0
+    for i != len(nums) {
+        j := i + 1
+        k := 0
+        for j != len(nums) {
+            diff := nums[j] - nums[j - 1]
+            if diff > 1 {
+                break
+            }
+            j++
+            if diff == 0 {
+                k++
+            }
+        }
+        ans = max(ans, j - i - k)
+        i = j
+    }
+    return ans
+}

From a4869e044e6dfbd44780bd4d488c47657f4695eb Mon Sep 17 00:00:00 2001
From: yhkee0404 <yhkee0404@gmail.com>
Date: Mon, 28 Jul 2025 07:40:04 +0900
Subject: [PATCH 5/5] house robber solution

---
 house-robber/yhkee0404.rs | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 house-robber/yhkee0404.rs

diff --git a/house-robber/yhkee0404.rs b/house-robber/yhkee0404.rs
new file mode 100644
index 000000000..aa5026e24
--- /dev/null
+++ b/house-robber/yhkee0404.rs
@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn rob(nums: Vec<i32>) -> i32 {
+        let mut dp = vec![0; nums.len() + 1];
+        dp[1] = nums[0];
+        for i in 2..dp.len() {
+            dp[i] = dp[i - 1].max(dp[i - 2] + nums[i - 1]);
+        }
+        return *dp.last()
+                .unwrap_or(&0)
+    }
+}