Search
⌘K

Leetcode 1806. Minimum Number of Operations to Reinitialize a Permutation

Given an even n and a fixed reindexing operation on perm, find the minimum positive number of times to apply it to restore the identity permutation — equivalently, compute the order of the induced index permutation by decomposing it into cycles and taking the LCM of their lengths.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.