https://ayushkoul00.github.io/CP-Blogs/A blog containing detailed notes on competitive programming problems and concepts. 2023-08-23T05:02:51+00:00 Ayush Koul https://ayushkoul00.github.io/CP-Blogs/ Jekyll © 2023 Ayush Koul /CP-Blogs/assets/img/favicons/favicon.ico /CP-Blogs/assets/img/favicons/favicon-96x96.png 2023-08-19T00:00:00+00:00 2023-08-23T05:02:14+00:00 https://ayushkoul00.github.io/CP-Blogs/posts/Search-In-Rotated-Sorted-Array/ Ayush Koul

Problem Link Brute-Force The problem tells us to find a target value in the array nums which is a sorted array that has been rotated around an unknown pivot. The brute force approach would be to go through each element in the array and check if it equals target. However, that solution is too trivial (Time: $\boldsymbol{O(n)}$) - the problem is asking to solve this in $\boldsymbol{O(\log(n))}$ ...

2022-07-25T00:00:00+00:00 2022-07-25T00:00:00+00:00 https://ayushkoul00.github.io/CP-Blogs/posts/Vacation/ Ayush Koul

Note: This problem is part of the Atcoder Educational Dp Contest Problem Link Brute-Force/Recursive Approach We know that we cannot take any given activity for two or more days in a row. So our decision to choose an activity will depend on what our previous decisions were: we will pass two parameters in our recursive function: i and j. Here, i denotes the ith day and j denotes the activi...

2022-07-21T00:00:00+00:00 2023-08-23T05:02:14+00:00 https://ayushkoul00.github.io/CP-Blogs/posts/Unbouned-Knapsack/ Ayush Koul

Problem Statement: We are given an array of n items, each with a weight ($\boldsymbol{W_i}$) and a profit ($\boldsymbol{P_i}$),and a bag (aka knapsack) which has a limited capacity of $\boldsymbol{C}$ (where $\boldsymbol{C}$ is the maximum amount of weight that the bag can hold). The goal is to find a subset of the items such that their total weight is <= C and the sum of their profits is ma...

2022-07-18T00:00:00+00:00 2022-07-18T00:00:00+00:00 https://ayushkoul00.github.io/CP-Blogs/posts/Frog2/ Ayush Koul

Note: This problem is part of the Atcoder Educational Dp Contest Problem Link Brute-Force/Recursive Approach Building from the logic of Frog 1, we know that if a frog can jump k stones ahead from a stone i, this also implies that a frog can only reach stone i by jumping from the previous k stones. Code #include <bits/stdc++.h> using namespace std; int recursive(vector<int> ...

2022-07-18T00:00:00+00:00 2022-07-18T00:00:00+00:00 https://ayushkoul00.github.io/CP-Blogs/posts/Frog1/ Ayush Koul

Note: This problem is part of the Atcoder Educational Dp Contest Problem Link Brute-Force/Recursive Approach We know that from given h[i], we can only go to either h[i+1] or h[i+2]. If we reverse this logic, we can see that from any given h[i], we can only arrive there either from h[i-1] or h[i-2]. Finally, the cost of arriving at h[0] is 0 (since we are already there when we start) and...