• 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

Password Predictor

Max Sum in circularly situated Values

Given Set of words or A String find whether chain is possible from these words or not

Find the smallest window in a string containing all characters of another string

Regular Expression Matching

Given a string, find the first character which is non-repetitive

Hackerearth : Counting Subarrays

Common Ancestor in a Binary Tree or Binary Search Tree

Advanced SQL Injection

Singly linked list

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

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

Test Cases for Round Function

1014 Practice Question of New GRE – Princeton

Generate next palindrome number

How Radix sort works

Handle duplicates in Binary Search Tree

The Magic HackerEarth Nirvana solutions Hiring Challenge

Microsoft BING Interview Experience

Check Binary Tree is Binary Search Tree or not

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Find loop in Singly linked list

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

Serialise Deserialise N-ary Tree

Fibonacci Hashing & Fastest Hashtable

Interfaces in C++ (Abstract Classes in C++)

Level order traversal in Spiral form

Introduction To Number Theory ( Part 1 )

Flipkart Set 1 On Campus with Answers

Copyright © 2026 · Genesis Framework · WordPress · Log in