Longest Uncommon Subsequence I Problem

Longest Uncommon Subsequence I Problem — ExecCode Easy DSA Practice

Solve the Longest Uncommon Subsequence I problem on ExecCode. Free online easy DSA practice in String. Write and run code in Java, C++, Python — no signup required to run.

Description Given two strings a and b, return the length of the longest uncommon subsequence between a and b. If no such uncommon subsequence exists, return -1 . An uncommon subsequence between two strings is a string that is a subsequence of exactly one of them. Examples Exampl…

Practice Longest Uncommon Subsequence I free on ExecCode. Browse more ExecCode DSA problems.