← Nagarro questions
CodingReported in a candidate post, Jan 2021

Longest Increasing Subsequence and String Turns

Filed under Nagarro

Given a string S and an integer k, in each turn, move the last k characters of the string to the front. Determine the minimum number of turns required to return the string to its original state. This…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Nagarro questions

Collected from public candidate posts and coding forums. Updated Nov 2026.