The Trade desk | OA | Simplified Matrix String Search| Jan 9 2024

Problem: Simplified Matrix String Search Objective: Given a matrix of characters and an array of distinct strings words, determine the total number of times any string from words can be found in the matrix following specific pathing rules. Pathing Rules Start: A path can start at any cell in the matrix. Initial Direction: A path must begin moving either Left to Right (L → R) or Top to Bottom (T → B). The Pivot: You are allowed to change direction ...