Interview Stages

Round 1: Phone Screen

• Process: A technical phone screen.
• Problem: Given a matrix containing '-' and letters, replace all '-' with the closest letter (distance of 1). If a '-' has multiple adjacent letters at distance 1, replace it with any one of them.
• Focus: Implementation of matrix traversal and logic for replacing characters based on adjacency.