Leetcode Problem 2002. Maximum Product of the Length of Two Palindromic Subsequences

2002. Maximum Product of the Length of Two Palindromic Subsequences

Leetcode Solutions

Define a recursive function dfs that takes the current index i, and two strings s1 and s2 representing the subsequences.
If i is equal to the length of s, check if s1 and s2 are palindromes. If they are, update the maximum product of their lengths.
Recursively call dfs to explore adding the current character to s1, to s2, or to neither.
Implement a helper function isPalin to check if a given string is a palindrome.
Call dfs starting with index 0 and empty strings for s1 and s2.
Return the maximum product found.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen