From 2d1a0fba367a5f3c3f7837560989e28829133122 Mon Sep 17 00:00:00 2001 From: "hjeom.dev" Date: Thu, 13 Nov 2025 21:01:41 +0900 Subject: [PATCH 1/5] contains duplicate --- contains-duplicate/hjeomdev.java | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 contains-duplicate/hjeomdev.java diff --git a/contains-duplicate/hjeomdev.java b/contains-duplicate/hjeomdev.java new file mode 100644 index 0000000000..f6aee6f557 --- /dev/null +++ b/contains-duplicate/hjeomdev.java @@ -0,0 +1,17 @@ +import java.util.HashSet; +import java.util.Set; + +class Solution { + public boolean containsDuplicate(int[] nums) { + Set set = new HashSet(); + for (int num : nums) { + set.add(num); + } + + if (set.size() != nums.length) { + return true; + } else { + return false; + } + } +} \ No newline at end of file From 984b20998ce148862d475a47fce0d453f2a2f1b0 Mon Sep 17 00:00:00 2001 From: "hjeom.dev" Date: Thu, 13 Nov 2025 22:16:28 +0900 Subject: [PATCH 2/5] top-k-frequent-elements --- top-k-frequent-elements/hjeomdev.java | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 top-k-frequent-elements/hjeomdev.java diff --git a/top-k-frequent-elements/hjeomdev.java b/top-k-frequent-elements/hjeomdev.java new file mode 100644 index 0000000000..92343f4ea7 --- /dev/null +++ b/top-k-frequent-elements/hjeomdev.java @@ -0,0 +1,18 @@ +class Solution { + public int[] topKFrequent(int[] nums, int k) { + Map map = new HashMap<>(); + + for (int num : nums) { + int current = map.getOrDefault(num, 0); + map.put(num, current + 1); + } + + List keySet = new ArrayList<>(map.keySet()); + keySet.sort((o1, o2) -> map.get(o2).compareTo(map.get(o1))); + + return keySet.subList(0, k) + .stream() + .mapToInt(Integer::intValue) + .toArray(); + } +} \ No newline at end of file From 12c1c56b34f4306ae117c83d7948b47f90fe32e0 Mon Sep 17 00:00:00 2001 From: "hjeom.dev" Date: Thu, 13 Nov 2025 22:17:40 +0900 Subject: [PATCH 3/5] two-sum --- two-sum/hjeomdev.java | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 two-sum/hjeomdev.java diff --git a/two-sum/hjeomdev.java b/two-sum/hjeomdev.java new file mode 100644 index 0000000000..3d70a8578e --- /dev/null +++ b/two-sum/hjeomdev.java @@ -0,0 +1,15 @@ +class Solution { + public int[] twoSum(int[] nums, int target) { + int[] answer = new int[2]; + for (int i = 0; i < nums.length; i++) { + for (int j = i + 1; j < nums.length; j++) { + if (nums[i] + nums[j] == target) { + answer[0] = i; + answer[1] = j; + break; + } + } + } + return answer; + } +} \ No newline at end of file From 52c6f2b9713e543789970a3c21d97cde5d4722b2 Mon Sep 17 00:00:00 2001 From: "hjeom.dev" Date: Fri, 14 Nov 2025 00:11:17 +0900 Subject: [PATCH 4/5] two-sum --- two-sum/hjeomdev.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/two-sum/hjeomdev.java b/two-sum/hjeomdev.java index 3d70a8578e..a0815fae41 100644 --- a/two-sum/hjeomdev.java +++ b/two-sum/hjeomdev.java @@ -12,4 +12,4 @@ public int[] twoSum(int[] nums, int target) { } return answer; } -} \ No newline at end of file +} From 25ed9551f371c470262e84b720341a31e65a3450 Mon Sep 17 00:00:00 2001 From: "hjeom.dev" Date: Fri, 14 Nov 2025 00:14:44 +0900 Subject: [PATCH 5/5] =?UTF-8?q?=EC=A4=84=EB=B0=94=EA=BF=88=20=EB=88=84?= =?UTF-8?q?=EB=9D=BD?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- contains-duplicate/hjeomdev.java | 2 +- top-k-frequent-elements/hjeomdev.java | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/contains-duplicate/hjeomdev.java b/contains-duplicate/hjeomdev.java index f6aee6f557..bfb5ecfcc6 100644 --- a/contains-duplicate/hjeomdev.java +++ b/contains-duplicate/hjeomdev.java @@ -14,4 +14,4 @@ public boolean containsDuplicate(int[] nums) { return false; } } -} \ No newline at end of file +} diff --git a/top-k-frequent-elements/hjeomdev.java b/top-k-frequent-elements/hjeomdev.java index 92343f4ea7..211942e64a 100644 --- a/top-k-frequent-elements/hjeomdev.java +++ b/top-k-frequent-elements/hjeomdev.java @@ -15,4 +15,4 @@ public int[] topKFrequent(int[] nums, int k) { .mapToInt(Integer::intValue) .toArray(); } -} \ No newline at end of file +}