• 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

Dhaval Dave

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

Fibonacci Hashing & Fastest Hashtable

July 31, 2018 by Dhaval Dave

Fibonacci Hashing : How do we find out what this Fibonacci Hashing is?
In real world Fibonacci hashing is not implemented or used even a part of it, because it’s actually more (Time and Space) … Read More

Filed Under: Algorithm, Data Structure, problem Tagged With: Hashing, Hashmap, Mathematical

Hackerearth : Counting Subarrays

July 7, 2018 by Dhaval Dave

Given an array A of N positive integer values. A sub-array of this array is called Odd-Even sub-array if the number of odd integers in this sub-array is equal to the number  of even integers … Read More

Filed Under: Algorithm, Array, Hacker Earth Questions Tagged With: Array, Hashing, implementation

Facebook Interview Question : Interleave List

May 14, 2018 by Dhaval Dave

Interleave List

Interleave List If input = [[1,2,3], [9, 0], [5], [-4,-5,-2,-3,-1]] then output = [1,9,5,-4,2,0,-5,3,-2,-3,-1];
Asked in Facebook F2F… Read More

Filed Under: Algorithm, Data Structure, Facebook Tagged With: 2d matrix, Array, Linked List

Serialise Deserialise N-ary Tree

April 19, 2018 by Dhaval Dave

Serialise Deserialise N-ary Tree : N-ary tree’s each node contains at-most N children. Serialise the tree means storing the tree in array or file maintaining tree’s exact structure. On the other hand Deserialise the tree … Read More

Filed Under: Uncategorized

Number of Islands BFS/DFS

April 5, 2018 by Dhaval Dave

example for rejecting a component

Problem Statement:

Given a 2d grid containing either values either 0 or 1 where 1 represents land and 0 represents water. You have to calculate the number of total islands in the given grid. An … Read More

Filed Under: Adobe Interview Questions, Algorithm, Amazon Interview Question, Data Structure, Graph Tagged With: 2d matrix, BFS, DFS

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

February 23, 2018 by Dhaval Dave

Find shortest distances between every pair of vertices in a given edge weighted directed Graph.

Input:
The first line of input contains an integer T denoting the no of test cases . Then T test … Read More

Filed Under: Amazon Interview Question, Graph, Microsoft Interview Questions Tagged With: Dynamic Programming, Graph

Diagonal Traversal of Binary Tree

February 23, 2018 by Dhaval Dave

Given a Binary Tree, print the diagonal traversal of the binary tree
Consider lines of slope -1 passing between nodes. Given a Binary Tree, print all diagonal elements in a binary tree belonging to same … Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Interview Questions, Microsoft Interview Questions, Tree Tagged With: BFS, Binary Tree, tree

Printing intermediate Integers between one element & next element of array

February 16, 2018 by Dhaval Dave

Problem : Printing intermediate Integers

User entered numbers are set into array.Intermediate integer of each pair of successive elements to be printed.

Input :
Input of 1st line is number of element in array,inputs of … Read More

Filed Under: Uncategorized

Coin Collection Dynamic Programming

February 4, 2018 by Dhaval Dave

Problem Statement:Coin Collection Dynamic Programming

Given a rectangular grid where each cell contains some coins. You are at the first row and you want to go to the last row with the objective of collecting … Read More

Filed Under: Algorithm, Interview Questions Tagged With: 2d matrix, Dynamic Programming

  • Page 1
  • Page 2
  • Page 3
  • …
  • Page 17
  • Next Page »

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

Stock Buy Sell to Maximize Profit

Find Percentage of Words matching in Two Strings

Python List

simple sql injection

SAP Off Campus Hiring_ March 2015 Sample Questions

Naurki.com Security Breach

Sequence Finder Dynamic Programming

Skiing on Mountains Matrix

Leetcode: Edit Distance

Maximum difference between two elements s.t larger element appears after the smaller number

SAP Hiring Off-Campus General Aptitude

C++ OOPs Part1

Doubly linked list

Flipkart SDET Interview Experience

Maximum size of square sub matrix with all 1’s in a binary matrix

Amazon Interview On-Campus For Internship – 1

Find next greater number with same set of digits

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

Maximum sum contiguous subarray of an Array

Apriori algorithm C Code Data Mining

Sort an array according to the order defined by another array

Get K Max and Delete K Max in stream of incoming integers

Subset Sum Problem Dynamic programming

Binary Tree in Java

TicTacToe Game As Asked in Flipkart

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

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

Memory Efficient LinkedList

Test Cases for Round Function

Knight Tour Problem (Graph – Breadth First Search)

Copyright © 2025 · Genesis Framework · WordPress · Log in