Skip to content

Latest commit

 

History

History
81 lines (33 loc) · 1.21 KB

File metadata and controls

81 lines (33 loc) · 1.21 KB

Description

You have a set of tiles, where each tile has one letter tiles[i] printed on it.  Return the number of possible non-empty sequences of letters you can make.

 

Example 1:

Input: "AAB"

Output: 8

Explanation: The possible sequences are "A", "B", "AA", "AB", "BA", "AAB", "ABA", "BAA".

Example 2:

Input: "AAABBC"

Output: 188

 

Note:

    <li><code>1 &lt;= tiles.length &lt;= 7</code></li>
    
    <li><code>tiles</code> consists of uppercase English letters.</li>
    

Solutions

Python3

Java

...