• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Matrix

LeetCode : Word Search

October 16, 2019 by Dhaval Dave

Word Search : Given a 2D board and a word, search if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell,
where “adjacent” cells are those horizontally … Read More

Filed Under: Amazon Interview Question, Google, LeetCode Tagged With: 2d matrix, Array, DFS, Matrix, Recursion

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Subset Sum Problem Dynamic programming

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Python String and numbers

How Radix sort works

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Implement a generic binary search algorithm for Integer Double String etc

Word Break Problem

Coin Collection Dynamic Programming

VMWare SDEII Interview

Connect n ropes with minimum cost

Mirror of Tree

LeetCode: Binary Tree Maximum Path Sum

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Python Array String

Get Minimum element in O(1) from input numbers or Stack

Introduction To Number Theory ( Part 1 )

Templates in C++

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Regular Expression Matching

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Doubly linked list

C++ OOPs Part2

Password Predictor

25 horses 5 tracks Find 3 fastest puzzle

Wrong Directions given find minimum moves so that he can reach to the destination

Add Sub Multiply very large number stored as string

Longest Increasing Subsequence

Naurki.com Security Breach

Find Percentage of Words matching in Two Strings

Difference between a LinkedList and a Binary Search Tree BST

Copyright © 2026 · Genesis Framework · WordPress · Log in