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...
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...
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...
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...
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...
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...