Round 1
Questions:
Given two strings, str and pattern, find the number of discontinuous matches of pattern in str. None of the matched letters can be next to each other in str.
Examples:
- pattern="cat", str="catapult", result=1, explanation: CatApulT
- pattern="cat", str="catatapult", result=2, explanation: CatcAtapulT, CatcatApulT, catCatApulT
Candidate's Approach
The candidate applied a recursive approach with backtracking to solve the problem. They encountered some syntax errors while compiling and running the code on HackerRank but managed to fix them. There was a minor issue in handling the previous index, but the candidate was able to convey their thought process effectively.
Interviewer's Feedback
No feedback provided.