Turing.com OA Turing Question
Summary
This post details an Online Assessment question from Turing.com, which requires constructing the largest possible number from a given string `num` such that no digit appears consecutively more than `k...
Interview Experience
Input: num = "3391933", k = 3 Output: "9933313" Explanation: largest possible number is "9933313", as you can see there is no continuous digit which is more than 3 times and largest number. Example 2: Input: num = "1121212", k = 2 Output: "221211" Explanation: largest possible number is "22121...


