• 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

C++ OOPs Part2

Password Predictor

Mirror of Tree

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

C Program for TAIL command of UNIX

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

Microsoft BING Interview Experience

Circular Linked List

Find position of the only set bit

Longest Increasing Subsequence

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

Reliance Jio Software Developer Interview Experience

TicTacToe Game As Asked in Flipkart

Implement LRU Cache

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

Maximum path sum between two leaves

Maximum of all subarrays of size k

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

Serialise Deserialise N-ary Tree

Check Binary Tree is Binary Search Tree or not

Reverse a Linked List in groups of given size

Word Break Problem

25 horses 5 tracks Find 3 fastest puzzle

CodeChef Code SGARDEN

Possible sizes of bus to carry n groups of friends

Skiing on Mountains Matrix

Binary Tree in Java

Closed Parentheses checker

Code Chef PRGIFT Solution

Maximum occurred Smallest integer in n ranges

Copyright © 2025 · Genesis Framework · WordPress · Log in