Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2.
An interleaving of two strings s and t is a configuration where s and t are divided into n and m substrings respectively, such that:
s = s1 + s2 + ... + sn
t = t1 + t2 + ... + tm
|n - m| <= 1
The interleaving is s1 + t1 + s2 + t2 + s3 + t3 + ... or t1 + s1 + t2 + s2 + t3 + s3 + ...
Note: a + b is the concatenation of strings a and b.
Interview questions [1]
Question 1
Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2.
An interleaving of two strings s and t is a configuration where s and t are divided into n and m substrings respectively, such that:
s = s1 + s2 + ... + sn
t = t1 + t2 + ... + tm
|n - m| <= 1
The interleaving is s1 + t1 + s2 + t2 + s3 + t3 + ... or t1 + s1 + t2 + s2 + t3 + s3 + ...
Note: a + b is the concatenation of strings a and b.
I applied online. I interviewed at Microsoft (Melbourne)
Interview
After submitting an online application, I received a HackerRank assessment after passing the resume screening stage, then I was rejected after completing the assessment and did not proceed to further interview rounds.
Interview questions [1]
Question 1
The assessment consisted of two LeetCode-medium-level coding questions to be completed within 75 minutes.
Straightforward technical loop overall, with strong interviewers at every stage. I genuinely enjoyed the in-depth conversations around technical challenges and algorithmic problem-solving — the entire process felt well-structured and genuinely engaging.
I applied through an employee referral. I interviewed at Microsoft (Bangalore Rural) in Jun 2026
Interview
The interview was hard, even as a fresher the dsa they asked was hard category after I checked on leetcode. Though I couldn't solve it. Some of the other people who interviewed were asked easy - medium dsa
