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…