Day 89 — Word Search
100 Days to Amazon
100 Days to Amazon — Day 89 — Word Search
Out of Free Stories? Here is my Friend Link.
Introduction🛹
Hey Guys, Today is day 89 of the challenge that I took. Wherein I will be solving every day for 100 days the programming questions that have been asked in previous interviews.
You have a bonus at the end if you keep reading. You can find out the companies that have asked these questions in real interviews.
All these problems are taken from the following e-book. 🎓
This is completely free 🆓 if you have an amazon kindle subscription.
This e-book contains 100 coding problems that have been asked in top tech interview questions. It also has a guide to solving all the problems in 200+ ways. These problems I assure you has been asked in previous interviews.
You have to decide whether you want to go unprepared for a tech interview or go ahead and quickly search for this guide to solve the 100 problems.
Begin Your ascent to greatness🚀
Note: this e-book only contains the links to the solutions. Code for 40 have been added.
Day 89 — Word Search🏁
AIM🏹
Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.
Example🕶
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
Given word = "ABCCED", return true.
Given word = "SEE", return true.
Given word = "ABCB", return false.