[Solved] How does this code works in c++? [closed]

Question

If the two strings are equal, there is no “uncommon subsequence”. If they are not equal, neither one is a subsequence of the other, but each one is a subsequence of itself, so each one is an “uncommon subsequence”. The longer of the two is the longest “uncommon subsequence”, and its length is the correct answer. If the two are not equal but have the same length, then each one is an “uncommon subsequence” and the length of the longest is just the length of either one.

Don’t get tangled up in what you (or any other reasonable person) think a “subsequence” is. The problem defines “uncommon subsequence”, and all you have to do is apply its definition. This “problem” is about word play, not coding.

Accepted Answer

If the two strings are equal, there is no “uncommon subsequence”. If they are not equal, neither one is a subsequence of the other, but each one is a subsequence of itself, so each one is an “uncommon subsequence”. The longer of the two is the longest “uncommon subsequence”, and its length is the correct answer. If the two are not equal but have the same length, then each one is an “uncommon subsequence” and the length of the longest is just the length of either one.

Don’t get tangled up in what you (or any other reasonable person) think a “subsequence” is. The problem defines “uncommon subsequence”, and all you have to do is apply its definition. This “problem” is about word play, not coding.