String Transformation at MathWorks
Hard26.6% acceptance
This problem has 62.5% frequency at MathWorks.
Problem Description
You are given two strings `s` and `t` of equal length `n`. You can perform the following operation on the string `s`: * Remove a **suffix** of `s` of length `l` where `0 < l < n` and append it at the start of `s`. For example, let `s = 'abcd'` then in one operation you can remove the suffix `'c...
Read full problem and hintsTopics
Also asked at 2 companies
More MathWorks Questions
Maximum Palindromes After OperationsMediumSell Diminishing-Valued Colored BallsMediumCount AnagramsHardRemove Colored Pieces if Both Neighbors are the Same ColorMediumLast Substring in Lexicographical OrderHard
View all MathWorks questions