1174. Scramble String

A string can be scrambled by recursively splitting it into two non-empty parts and optionally swapping them. Given s1 and s2 of equal length, determine whether s2 is a scramble of s1. Return true or false. The input is JSON {s1, s2}.

Input: JSON {s1, s2}.

Output: Boolean — true or false.

Examples

Input: {"s1":"great","s2":"rgeat"}
Output: true
Explanation: A valid scramble.

Input: {"s1":"abcde","s2":"caebd"}
Output: false
Explanation: Not a scramble.

Input: {"s1":"a","s2":"a"}
Output: true
Explanation: Identical single characters.

Constraints

• 1<=|s1|=|s2|<=30

Asked by