• 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

Graph

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

Knight Tour Problem (Graph – Breadth First Search)

December 22, 2017 by Dhaval Dave

Knight Tour Problem : Given a chess board of size n x n, initial position of knight and final position of knight. We need to find the minimum number of steps required to reach final … Read More

Filed Under: Algorithm, Amazon Interview Question, Flipkart Interview Questions, Graph, Microsoft Interview Questions Tagged With: algorithm, BFS, Graph

Spanning Tree

March 1, 2014 by Dhaval Dave

In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree that includes all of the vertices and some or all of the edges of G.

… Read More

Filed Under: problem Tagged With: Graph, tree

BFS (Breath First Search)

March 1, 2014 by Dhaval Dave

In graph theory, breadth-first search (BFS) is a strategy for searching in a graph when search is limited to essentially two operations: (a) visit and inspect a node of a graph; (b) gain access to

… Read More

Filed Under: problem Tagged With: Binary Tree, Graph, tree

DFS (Depth First Search)

March 1, 2014 by Dhaval Dave

DFS BFS Graph traversal

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores

… Read More

Filed Under: problem Tagged With: Binary Tree, Graph, tree

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

Difference between a LinkedList and a Binary Search Tree BST

Search element in a matrix with all rows and columns in sorted order

Coin Collection Dynamic Programming

Find the number ABCD such that when multipled by 4 gives DCBA.

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

Find position of the only set bit

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

Find the element that appears once others appears thrice

VMWare Openings

Trapping Rain Water

flattens 2 D linked list to a single sorted link list

C++ OOPs Part2

Word Break Problem

Reversal of LinkedList

Code Chef PRGIFT Solution

Print all nodes that are at distance k from a leaf node

Generate largest number arranging a no. of given non negative integer numbers

Right view of Binary tree

Count Possible Decodings of a given Digit Sequence

Password Predictor

Implement LRU Cache

Reverse a Linked List in groups of given size

Linked List V/S Binary Search Tree

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

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

Amazon Interview On-Campus For Internship – 1

LeetCode : Word Search

Python Dictionaries

Maximum path sum between two leaves

Walmart Labs Interview Experience

Copyright © 2025 · Genesis Framework · WordPress · Log in