Given a string S. How many permutations of string s is lexicographically smaller than S . If S = "cda" answer will be 2 . And the strings are {"acd","adc"}.
Permutations
Given a string S. How many permutations of string s is lexicographically smaller than S . If S = "cda" answer will be 2 . And the strings are {"acd","adc"}.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
LIFE_GOES_ON | 2020-06-27 05:39:36 | 8 | ||
| en2 |
|
LIFE_GOES_ON | 2020-06-26 23:19:26 | 2 | Tiny change: 'strings ar {"acd","a' -> 'strings are {"acd","a' | |
| en1 |
|
LIFE_GOES_ON | 2020-06-26 23:15:08 | 169 | Initial revision (published) |