longest-uncommon-subsequence-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an array of strings <code>strs</code>, return the length of the longest uncommon subsequence between them. If the longest uncommon subsequence does not exist, return <code>-1</code>.

An uncommon subsequence between an array of strings is a string that is a subsequence of one string but not the others.

A subsequence of a string <code>s</code> is a string that can be obtained after deleting any number of characters from <code>s</code>.

<ul>
	<li>For example, <code>&quot;abc&quot;</code> is a subsequence of <code>&quot;aebdc&quot;</code> because you can delete the underlined characters in <code>&quot;aebdc&quot;</code> to get <code>&quot;abc&quot;</code>. Other subsequences of <code>&quot;aebdc&quot;</code> include <code>&quot;aebdc&quot;</code>, <code>&quot;aeb&quot;</code>, and <code>&quot;&quot;</code> (empty string).</li>
</ul>

&nbsp;
Example 1:
<pre>Input: strs = ["aba","cdc","eae"]
Output: 3
</pre>Example 2:
<pre>Input: strs = ["aaa","aaa","aa"]
Output: -1
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= strs.length &lt;= 50</code></li>
	<li><code>1 &lt;= strs[i].length &lt;= 10</code></li>
	<li><code>strs[i]</code> consists of lowercase English letters.</li>
</ul>