Longest Common Subsequence (LCS) in DAA explain hinglish
LCS (Longest Common Subsequence) DAA ka ek important Dynamic Programming problem hai jisme do strings ke beech longest common subsequence find ki jaati hai. Isme characters ka contiguous hona zaroori nahi hota.