package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
# README
942. DI String Match
Solution idea
Greedy Algorithm: Extract IDD...D pattern and append in decreasing order
Note: permutation means no single number can be used repetitively
Time complexity = $O(n)$
Similar Question: 2375. Construct Smallest Number From DI String