From 722dce6ef9b405f83d12bd5265ba615b77dfd277 Mon Sep 17 00:00:00 2001 From: sangjo Date: Sat, 8 Nov 2025 23:18:17 +0900 Subject: [PATCH 1/5] solve --- contains-duplicate/Sbeo-Joe.cxx | 15 +++++++++++++++ two-sum/Sbeo-Joe.cpp | 30 ++++++++++++++++++++++++++++++ 2 files changed, 45 insertions(+) create mode 100644 contains-duplicate/Sbeo-Joe.cxx create mode 100644 two-sum/Sbeo-Joe.cpp diff --git a/contains-duplicate/Sbeo-Joe.cxx b/contains-duplicate/Sbeo-Joe.cxx new file mode 100644 index 0000000000..2b42295766 --- /dev/null +++ b/contains-duplicate/Sbeo-Joe.cxx @@ -0,0 +1,15 @@ +class Solution { +public: + bool containsDuplicate(vector& nums) { + set s; + + for(const auto& n : nums) { + auto iter = s.find(n); + if(iter != s.end()){ + return true; + } + s.insert(n); + } + return false; + } +}; \ No newline at end of file diff --git a/two-sum/Sbeo-Joe.cpp b/two-sum/Sbeo-Joe.cpp new file mode 100644 index 0000000000..e9cf5851d1 --- /dev/null +++ b/two-sum/Sbeo-Joe.cpp @@ -0,0 +1,30 @@ +class Solution { +public: + vector twoSum(vector& nums, int target) { + + for(int i = 0; i < nums.size() - 1; i++){ + for(int j = i + 1; j < nums.size(); j++){ + if(nums[i] + nums[j] == target){ + return std::vector{i, j}; + } + } + } + return {}; + } +}; + +class Solution { +public: + vector twoSum(vector& nums, int target) { + // value, index; + unordered_map um; + for(int i = 0; i < nums.size(); i++){ + int gap = target - nums[i]; + if(um.count(gap)){ + return {um[gap], i}; + } + um[nums[i]] = i; + } + return {}; + } +}; \ No newline at end of file From 17355ad08d3460e6700fe7a3169f7d8359b48c02 Mon Sep 17 00:00:00 2001 From: sangjo Date: Sat, 8 Nov 2025 23:18:53 +0900 Subject: [PATCH 2/5] fix --- contains-duplicate/{Sbeo-Joe.cxx => Sbeo-Joe.cpp} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename contains-duplicate/{Sbeo-Joe.cxx => Sbeo-Joe.cpp} (100%) diff --git a/contains-duplicate/Sbeo-Joe.cxx b/contains-duplicate/Sbeo-Joe.cpp similarity index 100% rename from contains-duplicate/Sbeo-Joe.cxx rename to contains-duplicate/Sbeo-Joe.cpp From 9d87f317affc1d44390913a4d3905186f387d79e Mon Sep 17 00:00:00 2001 From: sangjo Date: Sun, 9 Nov 2025 21:18:06 +0900 Subject: [PATCH 3/5] 3, 4 --- longest-consecutive-sequence/Sbeo_Joe.cpp | 23 +++++++++++++++++++++++ top-k-frequent-elements/Sbeo-Joe.cpp | 22 ++++++++++++++++++++++ 2 files changed, 45 insertions(+) create mode 100644 longest-consecutive-sequence/Sbeo_Joe.cpp create mode 100644 top-k-frequent-elements/Sbeo-Joe.cpp diff --git a/longest-consecutive-sequence/Sbeo_Joe.cpp b/longest-consecutive-sequence/Sbeo_Joe.cpp new file mode 100644 index 0000000000..b14be1ef89 --- /dev/null +++ b/longest-consecutive-sequence/Sbeo_Joe.cpp @@ -0,0 +1,23 @@ +class Solution { +public: + int longestConsecutive(vector& nums) { + if(nums.size() == 0) return 0; + set us{nums.begin(), nums.end()}; + int ret = 1; + vector vec(us.begin(), us.end()); + int prevNum = vec[0]; + int ret_candi = 1; + for(int i = 1; i < vec.size(); i++){ + if(vec[i] - vec[i-1] == 1){ + ret_candi++; + ret = max(ret, ret_candi); + continue; + } else { + ret_candi = 1; + continue; + } + } + + return ret; + } +}; \ No newline at end of file diff --git a/top-k-frequent-elements/Sbeo-Joe.cpp b/top-k-frequent-elements/Sbeo-Joe.cpp new file mode 100644 index 0000000000..3b486d6679 --- /dev/null +++ b/top-k-frequent-elements/Sbeo-Joe.cpp @@ -0,0 +1,22 @@ +class Solution { +public: + vector topKFrequent(vector& nums, int k) { + // value, count + unordered_map um; + for(auto& n : nums){ + um[n]++; + } + + //value, count + vector> vec(um.begin(), um.end()); + sort(vec.begin(), vec.end(), + [](const auto& a, const auto& b) { return a.second > b.second;}); + + vector ret; + for(int i=0; i< k; i++){ + ret.push_back(vec[i].first); + } + + return ret; + } +}; \ No newline at end of file From 629962953ddb417dc337add764ea7227238898fc Mon Sep 17 00:00:00 2001 From: sangjo Date: Sun, 9 Nov 2025 22:02:22 +0900 Subject: [PATCH 4/5] 5 --- house-robber/Sbeo-Joe.cpp | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 house-robber/Sbeo-Joe.cpp diff --git a/house-robber/Sbeo-Joe.cpp b/house-robber/Sbeo-Joe.cpp new file mode 100644 index 0000000000..66e0a422dd --- /dev/null +++ b/house-robber/Sbeo-Joe.cpp @@ -0,0 +1,26 @@ +class Solution { +public: + int map[101]; + int rob(vector& nums) { + + memset(map, -1, sizeof(map)); + int ret = -1; + for(int i = 0; i < nums.size(); i++){ + ret = max(ret, solve(nums, i)); + } + return ret; + } + + int solve(vector& nums, int here) { + if(here >= nums.size()) return 0; + + int& ret = map[here]; + if(ret != -1) return ret; + ret = nums[here]; + for(int there = here + 2; there < nums.size(); there++){ + ret = max(ret, solve(nums, there) + nums[here]); + } + return ret; + } + +}; \ No newline at end of file From 961f77a6e1afe68d0eaabc4c1903cb19a7a40cd3 Mon Sep 17 00:00:00 2001 From: sangjo Date: Sun, 9 Nov 2025 22:17:29 +0900 Subject: [PATCH 5/5] space --- contains-duplicate/Sbeo-Joe.cpp | 2 +- house-robber/Sbeo-Joe.cpp | 2 +- longest-consecutive-sequence/{Sbeo_Joe.cpp => Sbeo-Joe.cpp} | 2 +- top-k-frequent-elements/Sbeo-Joe.cpp | 2 +- two-sum/Sbeo-Joe.cpp | 2 +- 5 files changed, 5 insertions(+), 5 deletions(-) rename longest-consecutive-sequence/{Sbeo_Joe.cpp => Sbeo-Joe.cpp} (99%) diff --git a/contains-duplicate/Sbeo-Joe.cpp b/contains-duplicate/Sbeo-Joe.cpp index 2b42295766..71bf63df8b 100644 --- a/contains-duplicate/Sbeo-Joe.cpp +++ b/contains-duplicate/Sbeo-Joe.cpp @@ -12,4 +12,4 @@ class Solution { } return false; } -}; \ No newline at end of file +}; diff --git a/house-robber/Sbeo-Joe.cpp b/house-robber/Sbeo-Joe.cpp index 66e0a422dd..86fa032700 100644 --- a/house-robber/Sbeo-Joe.cpp +++ b/house-robber/Sbeo-Joe.cpp @@ -23,4 +23,4 @@ class Solution { return ret; } -}; \ No newline at end of file +}; diff --git a/longest-consecutive-sequence/Sbeo_Joe.cpp b/longest-consecutive-sequence/Sbeo-Joe.cpp similarity index 99% rename from longest-consecutive-sequence/Sbeo_Joe.cpp rename to longest-consecutive-sequence/Sbeo-Joe.cpp index b14be1ef89..058310ef2d 100644 --- a/longest-consecutive-sequence/Sbeo_Joe.cpp +++ b/longest-consecutive-sequence/Sbeo-Joe.cpp @@ -20,4 +20,4 @@ class Solution { return ret; } -}; \ No newline at end of file +}; diff --git a/top-k-frequent-elements/Sbeo-Joe.cpp b/top-k-frequent-elements/Sbeo-Joe.cpp index 3b486d6679..cec4d4a3cb 100644 --- a/top-k-frequent-elements/Sbeo-Joe.cpp +++ b/top-k-frequent-elements/Sbeo-Joe.cpp @@ -19,4 +19,4 @@ class Solution { return ret; } -}; \ No newline at end of file +}; diff --git a/two-sum/Sbeo-Joe.cpp b/two-sum/Sbeo-Joe.cpp index e9cf5851d1..7455f8cd89 100644 --- a/two-sum/Sbeo-Joe.cpp +++ b/two-sum/Sbeo-Joe.cpp @@ -27,4 +27,4 @@ class Solution { } return {}; } -}; \ No newline at end of file +};