**Longest Uncommon Subsequence I** https://leetcode.com/problems/longest-uncommon-subsequence-i/description/

**Decide on properties of input**

- If a and b are the same, then return -1.
- Otherwise, return the length of the larger string - that is the longest uncommon subsequence.

```
class Solution(object):
def findLUSlength(self, a, b):
"""
:type a: str
:type b: str
:rtype: int
"""
if a == b:
return -1
elif len(a) > len(b):
return len(a)
else:
return len(b)
```