CodingHardcod-g391

Subject StringsLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

A string can be 'scrambled' by recursively splitting it into two non-empty parts and optionally swapping them, applying this to either part. Given strings s1 and s2 of equal length (1 <= len <= 30, lowercase letters), return True if s2 is a scramble of s1.

Implement

is_scramble(s1: str, s2: str) → bool

Examples

in["great","rgeat"]outtrue

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.