Q1. https://cses.fi/problemset/task/1633/ Variant of Coin Change Problem “For each i as target, count all possible ways using given coins” dp[i] = All possible ways to get i using all coins

Binary Search : Part 1 (LowerBound and UpperBound) Starting with basic template for lower bound and upper bound, Given an array and a target value, we are suppose to find value greater then equal to target (Lower Bound) and value greater then target (Upper Bound) Lower Bound (iterative , C++ function)

Step-1: Installation of Nginx on Host. (Debian)

1. Reach Target (Minimum or Maximum Value/count) Statement: Given a target find minimum (maximum) cost / path / sum to reach the target. Approach: Choose minimum (maximum) path among all possible paths before the current state, then add value for the current state. routes[i] = min(routes[i-1], routes[i-2], ... , routes[i-k]) + cost[i] Generate optimal solutions for all…