Nov 30, 2025 · 2 min read · Problem Given a string s, find the longest palindromic subsequence*'s length in* s. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements. (link) Exa...
Join discussionNov 30, 2025 · 3 min read · Problem You are given two strings s1 and s2. Your task is to print all distinct longest common subsequences in lexicographical order. Note: A subsequence is derived from another string by deleting some or none of the elements without changing the ord...
Join discussionNov 23, 2025 · 5 min read · Problem 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...
Join discussion