• 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

Recursion

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

Leetcode: Edit Distance

October 10, 2019 by Arshdeep Singh

Given two words word1 and word2, find the edit distance between word1 and word2 i.e. minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on … Read More

Filed Under: Algorithm, Amazon Interview Question, Google, LeetCode, Uncategorized Tagged With: Dynamic Programming, Recursion, string

Print Power Set of a Set

April 18, 2015 by Dhaval Dave

Print Power Set of a Set of character.

Power Set Power set P(S) of a set S is the set of all subsets of S. For example S = {a, b, c} then P(s) =

… Read More

Filed Under: Adobe Interview Questions, Hacker Earth Questions, Interview Questions, problem Tagged With: Array, Recursion, string

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

April 13, 2015 by Dhaval Dave

A building has n steps. A person can take 1,2 or 3 steps. In how many ways can a person reach top of building.

In order to build logic, lets think from first step
If … Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Microsoft Interview Questions, problem Tagged With: Dynamic Programming, Mathematical, Recursion

Count number of ways to reach a given score in a game

March 16, 2015 by Dhaval Dave

Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of ways to reach the given score.Examples:
Input: n = 20
… Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, problem Tagged With: Dynamic Programming, Recursion

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

July 10, 2014 by Dhaval Dave

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.

… Read More

Filed Under: Amazon Interview Question, Data Structure, Interview Questions, Microsoft Interview Questions, problem Tagged With: 2d matrix, Dynamic Programming, 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

Find the element that appears once others appears thrice

Word Break Problem

Doubly linked list

LeetCode: Container With Most Water

Given a float number convert it into the string WITHOUT using any inbuilt Function

Find and print longest consecutive number sequence in a given sequence in O(n)

Given a sorted array and a number x, find the pair in array whose sum is closest to x

HackeEarth Flipkart’s Drone

Password Predictor

Binary Tree in Java

Memory Efficient LinkedList

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

FizzBuzz Solution C C++

The Magic HackerEarth Nirvana solutions Hiring Challenge

Python Dictionaries

Skiing on Mountains Matrix

VMWare Openings

LeetCode: Binary Tree Maximum Path Sum

C++ OOPs Part1

Longest Increasing Subsequence

Binary Tree in Java

Length of the longest substring without repeating characters

Microsoft BING Interview Experience

Cisco Hiring Event 21st – 22nd Feb 2015

Singly linked list

Urban Ladder Written Test.

Walmart Labs Interview Experience

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Regular Expression Matching

Copyright © 2026 · Genesis Framework · WordPress · Log in