Schneider Electric OA 2026 | Interleaving String DP & Maximum Sum Submatrix

Problem 1 - Interleaving Text Construction (State-Machine DP) Problem Statement You are given three strings: s1 s2 s3 Determine whether s3 can be formed by interleaving the characters of s1 and s2. The relative ordering of characters originating from s1 and s2 must remain unchanged. Return true if such an interleaving is possible; otherwise return false. Constraints Constraint 0 ≤ length(s1), length(s2) ≤ 100 0 ≤ length(s3) ≤ 200 Test Cases Input Output Explanation s1 = "aabcc" s2 = "dbbca" ...