1. Problem Statement (Simple Explanation) We define a scramble operation on a string s: If |s| == 1: stop. If |s| > 1: Split s at some index i into two non-empty substrings: x = s[0..i-1], y = s[i..end]. Randomly choose to keep them in order (x + y) or swap them (y + x). Recursively apply the same process to x and y. Given two strings s1 and s2 of equal length , return true if s2 is a scrambled string of s1 under this definition, otherwise false. Constraints: 1 <= length(s1) <= 30 s1.length == s2.length Both consist of lowercase letters. 2. Examples Example 1: Input: s1 = "great", s2 = "rgeat" One valid scrambling sequence: "great" → split "gr" + "eat" No swap: "gr" + "eat" Recurse: "gr" → "g" + "r" → swap → "rg" Recurse: "eat" → "e" + "at" → "e" + "a" + "t" (no swaps) F...