---
title: "Chaewoon kang (@riveroverflow) | Hashnode"
description: "Chaewoon kang (@riveroverflow) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@riveroverflow"
---

@riveroverflow

# Chaewoon kang

@riveroverflow · Paju-si, Korea · Joined February 2025

### [Educational Codeforces Round177(Div. 2) Reivew(A~D)](https://riveroverflow.hashnode.dev/educational-codeforces-round177div-2-reivewad?utm_source=hashnode&utm_medium=feed)

Review and analysis of solutions for Codeforces Educational Round 177 (Div. 2) problems A-D, including techniques and insights

6 min read · [riveroverflow.hashnode.dev](https://riveroverflow.hashnode.dev/educational-codeforces-round177div-2-reivewad?utm_source=hashnode&utm_medium=feed)

[Apr 5, 2025](https://hashnode.com/posts/educational-codeforces-round177div-2-reivewad/67f14cfe1038132a5361e494)

### [\[Codeforces\] Round 1014(Div.2) Review(A~D)](https://riveroverflow.hashnode.dev/codeforces-round-1014div2-reviewad?utm_source=hashnode&utm_medium=feed)

Review of Codeforces Round 1014 (Div. 2): Problem-solving experiences with A-D, upsolve insights, and strategies for future contests

5 min read · [riveroverflow.hashnode.dev](https://riveroverflow.hashnode.dev/codeforces-round-1014div2-reviewad?utm_source=hashnode&utm_medium=feed)

[Mar 30, 2025](https://hashnode.com/posts/codeforces-round-1014div2-reviewad/67e95679d651fb550b913a5b)

### [\[Codeforces\] Round 1013(Div.3) Review(A~E)](https://riveroverflow.hashnode.dev/codeforces-round-1013div3-reviewae?utm_source=hashnode&utm_medium=feed)

Review of Codeforces Round 1013 (Div. 3), solving problems A-D, challenges faced, and insights gained

7 min read · [riveroverflow.hashnode.dev](https://riveroverflow.hashnode.dev/codeforces-round-1013div3-reviewae?utm_source=hashnode&utm_medium=feed)

[Mar 27, 2025](https://hashnode.com/posts/codeforces-round-1013div3-reviewae/67e4e27b4cbfa0bed1f088ad)

### [\[LeetCode\] 3394. Check if Grid can be Cut into Sections](https://riveroverflow.hashnode.dev/leetcode-3394-check-if-grid-can-be-cut-into-sections?utm_source=hashnode&utm_medium=feed)

Check if a grid can be divided into sections using horizontal or vertical cuts with sorting and sweeping techniques. Medium difficulty

3 min read · [riveroverflow.hashnode.dev](https://riveroverflow.hashnode.dev/leetcode-3394-check-if-grid-can-be-cut-into-sections?utm_source=hashnode&utm_medium=feed)

[Mar 25, 2025](https://hashnode.com/posts/leetcode-3394-check-if-grid-can-be-cut-into-sections/67e2471e576e67a4d4d6eec7)

### [\[LeetCode\] 3169. Count Days Without Meetings](https://riveroverflow.hashnode.dev/leetcode-3169-count-days-without-meetings?utm_source=hashnode&utm_medium=feed)

Leetcode solution for counting days without meetings using heap, sorting, and greedy algorithms for efficient processing

3 min read · [riveroverflow.hashnode.dev](https://riveroverflow.hashnode.dev/leetcode-3169-count-days-without-meetings?utm_source=hashnode&utm_medium=feed)

[Mar 24, 2025](https://hashnode.com/posts/leetcode-3169-count-days-without-meetings/67e0b4cd9cf2e23d2855e832)
