• 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

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

VMWare SDEII Interview

System Design: Designing a LLD for Hotel Booking

Handle duplicates in Binary Search Tree

Microsoft BING Interview Experience

Sort an array according to the order defined by another array

LeetCode: Container With Most Water

Add Sub Multiply very large number stored as string

Find the element that appears once others appears thrice

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

The greedy coins game Dynamic Programming

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

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

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Implement a generic binary search algorithm for Integer Double String etc

Level order traversal in Spiral form

Trie Dictionary

strtok()

Walmart Labs Interview Experience

CodeChef Code SGARDEN

DFS (Depth First Search)

Find if two rectangles overlap

Find position of the only set bit

BlueStone E-commerce Interview Experience

Find Nearest Minimum number in left side in O(n)

Templates in C++

Print Power Set of a Set

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Reversal of LinkedList

Binary Tree Isomorphic to each other

Copyright © 2026 · Genesis Framework · WordPress · Log in