30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 79. Word Search

Determine whether a target word can be formed by a path of horizontally or vertically adjacent cells in an m×n letter grid without reusing a cell. The core challenge is performing DFS/backtracking on the grid with visited tracking (and optional pruning) to efficiently explore valid paths.

Asked at:

Google

Amazon

Whatnot

Uber

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late July, 2025

Uber

Mid-level

same as leetcode

Late February, 2025

Amazon

Senior

Mid February, 2025

Whatnot

Senior

Get Premium to View All 5 Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 79. Word Search

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact