1. You will be given 2 strings s1 and s2, assuming you make a binary tree out of it by partioning it into 2 non-empty substrings recursively 2. To scramble the string, choose any non-leaf node and swap its two children 3. If s2 is a scrambled string of s1, return true else false 4. Input and output is handled for you 5. It is a functional problem ,please do not modify main()
Input Format
Input is handled for you
Output Format
Output is handled for you
Constraints
String will have lowercase letters
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
apple papel
Output
true