Reddit Associate Developer Interview Question 2025 April | Dynamic Programming | on-campus

Question 1: Longest Common Subsequence Problem Statement Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters. A common subsequence is a subsequence that is common to both strings. Constraints 1 <= text1.length, text2.length <= 1000 text1 and ...