Best Matrix Interview Question @ twitter, amazon, apple, microsoft, google, meta || Word Search: 79

#wordle #array #matrix #technical #interview #question #leetcode #problem #2darray #2dmatrix #twitter #microsoft #google #amazon #facebook #apple #meta #uber #bloomberg #paytm #bigO

This is one of the most asked Matrix interview question, from Leetcode that has very practical real-life application.

Learn to solve this amazing Leetcode medium, Matrix problem that has been asked in hundreds of technical interviews at companies like Google, Facebook, Amazon, Microsoft, Meta, apple, Uber, Twitter, Bloomberg.

Problem: Word Search- Leetcode 79

Leetcode: 79

Not stopping till we get employed in FAANG.

This Problem was recently asked in following companies in Technical Coding Interview:
Amazon interview,
Twitter interview,
Microsoft interview,
Karat interview,
Uber interview,
Bloomberg interview,
Facebook interview,
Indeed interview,
Cisco interview,
tiktok interview,
Snapchat interview,
Adobe interview,
Google interview,
Apple interview,
Wayfair interview,
Samsung interview,
Roblox interview,
Bolt interview,
Goldman Sachs interview,
Oracle interview,
ByteDance interview,
Qualtrics interview,
VMware interview,
eBay interview,
Flipkart interview,
Intuit interview,
Pinterest interview,
Cruise Automation interview,
ServiceNow interview,
Expedia interview,
Paypal interview,
-------------------------------------------------------------------------------------------------------------------------
(Contact me if you want to sponsor your product):

List of Most Important Questions and Solutions:

GitHub Repository for Questions solved so far:

(Support the channel, if videos helps you in any manner... Give me a Coffee)

About me and My Purpose:

I am a software engineer with 5+ years of experience @ Non-FAANG company. I have always been bad at coding and really bad at programming interviews. So, once I got employed in IT industry, I only worked on operational activities (just so I can avoid coding).

But deep down I always wanted to work at an Elite IT company. So, I decided to face my fears, and to master coding & technical Interviews. I started with LeetCoding 1 problem a day. But I was facing issues with consistency, I would solve LC problems for week, and then drop it for 2-3 weeks. This lasted till 6 months.

And upon deeper investigation I found that I was not committed enough. Then suddenly my wife gave me an idea, that rather then focusing on solving a LC problem for my-self, why don't I commit to make videos on solving the LC problems. And try to complete at-least one video every alternate day. Hence, I started this channel.

My ultimate aim is to get into FAANG company, and also create a channel in such a way that anyone wants to get into FAANG, if they just follow my channel, they should be able to clear all the FAANG Technical Interviews.

Here are few more reasons on why I started the channel.

1) To have a motive for me to solve leetcode problems.
2) In order to solve a LC problem, first I have to really understand the problem and explain my thought process, which solidifies my concepts.
3) I can document my progress. Also learn a new skill on how to run a YT channel.
4) My work can help other software engineers.
5) I can have something cool to mention in my linked-in and resume.
-----------------------------------------------------------------------------------------------------------------------------------

Here is a list of my dream Companies:

FAANG,
Meta,
Facebook,
Google,
Amazon,
Netflix,
Microsoft,
apple,
doordash,
roblox,
stripe,
instacart,
uber,
lyft,
twitter,
linked In,
pinetrest,
bloomberg,
robinhood,
Goldman Sachs,
box,
two sigma,
byte dance,
tik tok,
air bnb,
nuro,
ui path,
oracle,
twitch,
data bricks,
waymo,
dropbox,
coinbase,
snowflake,
snap,
nvdia,
broadcom,
slack,
intel,
cisco,
indeed,
salesforce,
reddit,
wayfair,
okta,
splunk,
service now,
coursera,
square,
upgrade,
mozilla,
yelp,
unity,
ebay,
affirm,
stach adapt,
amplitude,
github,
wish,
brex,
etsy,
chime,
shopify,
amd,
GoDaddy,
IBM

Introduction: 00:00
Understanding the Problem Statement: 00:45
Optimal Solution: 02:24
Coding: 08:53

[DestinationFAANG]

Repository for Questions solved so far




Java Solution

class Solution {

public char[][] board;
public int rows;
public int cols;

public boolean exist(char[][] board, String word) {

this.board = board;
this.rows = board.length;
this.cols = board[0].length;

for(int r = 0; r<rows; r++){
for(int c=0; c<cols; c++){
if(backtrack(r, c, word, 0)){
return true;
}
}
}

return false;

}

public boolean backtrack(int row, int col, String word, int index){
if(index >= word.length()){
return true;
}

if(row < 0 || row >= rows || col < 0 || col >= cols || this.board[row][col] != word.charAt(index)){
return false;
}

int [] rowdir = {0, 1, 0, -1};
int[] coldir = {1, 0, -1, 0};
this.board[row][col] = '#';

boolean ret = false;
for(int d = 0; d<4; d++){
ret = backtrack(row + rowdir[d], col + coldir[d], word, index+1);
if(ret){
break;
}
}
board[row][col] = word.charAt(index);
return ret;

}


}