Problem Statement

Array Challenge Problem body { font-family: Arial, sans-serif; line-height: 1.6; margin: 20px; } .problem-container { max-width: 900px; margin: auto; padding: 20px; border: 1px solid #ddd; border-radius: 8px; background: #f9f9f9; } h1, h3 { color: #333; } pre { background: #f4f4f4; padding: 10px; border: 1px solid #ddd; border-radius: 5px; overflow-x: auto; } ul { margin: 0; padding-left: 20px; } .example { margin-top: 20px; } .example .input, .example .output { margin-bottom: 10px; } Array Challenge Implement ArrayChallenge(strArr) so that it works with whatever strArr argument it is passed: an array holding exactly two strings, each built only from the characters {a, b, c} . Your task is to return the length of the longest subsequence that is common to both strings. A shared subsequence does not need its characters to sit at consecutive positions in the original strings. For example, if strArr is ["abcabb", "bacb"], the program should return 3 , because "bab" is a common subsequence