Solving Letter Tile Possibilities in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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:

  1. 1 <= tiles.length <= 7
  • 1 <= tiles.length <= 7

See the full details of the problem Letter Tile Possibilities at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go