**Longest Uncommon Subsequence I ** Given two strings `a`

and `b`

, return *the length of the longest uncommon subsequence between *

`a`

*and*

`b`

. If the longest uncommon subsequence does not exist, return `-1`

.An **uncommon subsequence** between two strings is a string that is a **subsequence of one but not the other**.

A **subsequence** of a string `s`

is a string that can be obtained after deleting any number of characters from `s`

.

- For example,
`"abc"`

is a subsequence of`"aebdc"`

because you can delete the underlined characters in`"a`

to get__e__b__d__c"`"abc"`

. Other subsequences of`"aebdc"`

include`"aebdc"`

,`"aeb"`

, and`""`

(empty string).

**Example 1:**

Input:a = "aba", b = "cdc"Output:3Explanation:One longest uncommon subsequence is "aba" because "aba" is a subsequence of "aba" but not "cdc". Note that "cdc" is also a longest uncommon subsequence.

**Example 2:**

Input:a = "aaa", b = "bbb"Output:3Explanation:The longest uncommon subsequences are "aaa" and "bbb".

**Example 3:**

Input:a = "aaa", b = "aaa"Output:-1Explanation:Every subsequence of string a is also a subsequence of string b. Similarly, every subsequence of string b is also a subsequence of string a.

**Constraints:**

`1 <= a.length, b.length <= 100`

`a`

and`b`

consist of lower-case English letters.

### Longest Uncommon Subsequence I Solutions

✅**Time:** O(n)

✅**Space:** O(n)

**C**++

` Will be updated Soon`

**Java**

```
Will be updated Soon
```

**Python**

```
Will be updated Soon
```

#### Watch Tutorial

**Checkout more Solutions here**