Concert.ai | Software Engineer Intern (Intern) | Coding+MCQ | Online Assessment

You are given a lowercase English string s and a positive integer k. A string made up of lowercase English letters is considered balanced if the frequency of every character in the string is a multiple of k. Your task is to find the lexicographically smallest balanced string of length n that is lexicographically not smaller than the given string s. If it is impossible to construct such a string, output −1. A string x...