riveroverflow

[Codeforces] Round 1014(Div.2) Review(A~D)

Mar 30, 20255 min read

[Codeforces] Round 1013(Div.3) Review(A~E)

Mar 27, 20257 min read

Educational Codeforces Round177(Div. 2) Reivew(A~D)

https://codeforces.com/contest/2086/problems I solved A, C in Contest, and Upsolved B, D with editorial.I spent too much time on B, stupidly. A - Cloudberry Jam (math, greedy) It could be solved instantly with intuition, but I didn't.Because I was n...

Apr 5, 20256 min read

[LeetCode] 3394. Check if Grid can be Cut into Sections

Mar 25, 20253 min read

[LeetCode] 3169. Count Days Without Meetings

Mar 24, 20253 min read

[Codeforces] Round 1011(Div.2) Review(A~D)

https://codeforces.com/contest/2085 I solved 2 problems(A, B), and upsolved 2 problems(C, D). A - Serval and String Theory (greedy, implementation) I struggled with solving A. it took 20 minutes, which is long-time for general A problems. Approach Tr...

Mar 23, 20255 min read

[LeetCode] 1976. Number of Ways to Arrive at Destination

Problem https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/description Leetcode - Number of Ways to Arrive at Destination Type - Graph Theory, Dijkstra Difficulty - Medium Approach & Solution Dijkstra’s Algorithm provides us to sol...

Mar 23, 20253 min read

[LeetCode] 2685. Count the Number of Complete Components

Problem https://leetcode.com/problems/count-the-number-of-complete-components/description Leetcode - Count the number of complete components Type - Graph Theory, DFS/BFS Difficulty - Medium Approach & Solution To determine whether a component in a gr...

Mar 22, 20253 min read

[LeetCode] 2115. Find All Possible Recipes from Given Supplies

Problem https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/description Leetcode - Find All Possible Recipes from Given Supplies Type - Topological Sort, String, HashMap Difficulty - Medium Approach & Solution Recipes can also...

Mar 21, 20253 min read

[LeetCode] 3108. Minimum Cost Walk in Weighted Graph

Problem https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/description Leetcode - Minimum Cost Walk in Weighted Graph Type - BitMask, Graph Theory, Disjoint set Union, Difficulty - Hard Approach & Solution To answer 10^5 queries, the r...

Mar 20, 20253 min read

[LeetCode] 3191. Minimum Operations to Make Binary Array Elements Equal to One I

Problem https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/description/ Leetcode - Minimum Operations to Make Binary Array Elements Equal to One I Type - Greedy, Sliding window, BitMask Difficulty - Medium A...

Mar 19, 20252 min read

Command Palette

Latest articles