DSAGeeks
Scramble String Recursive
Hard

Problem Statement

Determine if one string is a scrambled form of another by recursive partition and swap.

Examples

1Example 1
Input:
{ "s1": "great", "s2": "rgeat" }
Output:
true
2Example 2
Input:
{ "s1": "abcde", "s2": "caebd" }
Output:
false
3Example 3
Input:
{ "s1": "a", "s2": "a" }
Output:
true
Loading...

Sign in to Run Code and Submit