## Basketball Exercise Codeforce 1195C Editorial Explained

This is another editorial post of the codeforce problem Basketball Exercise. Detailed BasketBall Exercise Editorial The problem is basically a DP problem where we have the choice to choose such that  no consecutive chosen students…

## Mashmokh and ACM Editorial | GeeksToCode

This is an editorial post of the code forces problem Mashmokh and ACM. Problem Statement Mashmokh’s boss, Bimokh, didn’t like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM…

## Longest Subsequence Problem

Leetcode Problem 1143 Given two strings text1 and text2, return the length of their longest common subsequence. It is known as longest subsequence problem. A subsequence of a string is a new string generated from…

## Dynamic Programming

Solving Dynamic Problem Easy Dynamic Programming (DP) is a technique that solves a few specific form of problems in Polynomial Time. Dynamic Programming solutions are quicker than the exponential brute method and can be effortlessly…