Java Interview with a Microsoft Engineer: Word Transformation Search

This is an *unsuccessful* mock interview with a Microsoft engineer, where the prospective candidate must tackle a medium level question. The question, “Word Transformation Search“, requires candidates to find given words in the provided matrix, with the limitation of following the same direction. This solution was attempted by using a Trie data structure. Keep an eye out for the useful advice the interviewer gives to improve! 👉 Get $100 off your first professional mock interview with this link!: 📖 Check out feedback from the FAANG interviewer and the full transcript on 📘 Or view other system design interviews: ❗ Disclaimer: All interviews are shared with explicit permission from the interviewer and the interviewee, and all interviews are anonymous. has the sole right to distribute this content. TIMESTAMPS 00:00 Start 00:30 Question Starts 32:30 Coding Starts 48:15 Feedback