Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3029. Minimum Time to Revert Word to Initial State I
Given a string and integer k, you repeatedly remove the first k characters and append any k characters to the end; compute the minimum positive number of such operations needed to restore the string to its original configuration. The core challenge is analyzing the position permutation induced by the remove-and-append step to find the smallest number of iterations (cycle/period) that allows the original arrangement to be reconstructed.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.