Computer Sciences > Gate 2020 > Greedy Algo
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ________ .
Correct : 12
Total Unique Visitors
Loading......