Atlassian SDE-1 OA 2024 | Match Substring After Replacement & Nearest Shorter Tower

Problem 1 - Match Substring After Replacement Problem Statement You are given two strings s and sub, along with a list of character mappings. Each mapping is represented as: [old_char, new_char] indicating that any occurrence of old_char in sub may be replaced with new_char. Determine whether it is possible to make sub appear as a substring of s after performing zero or more valid replacements. Note: Mappings are one-way only. Mappings cannot be chained. Replacements may only be applied to ...