• 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

Walmart Labs Interview Experience

VMWare SDEII Interview

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

Skiing on Mountains Matrix

Test Cases for Round Function

Doubly linked list

Hackerearth : Counting Subarrays

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

Amazon Interview Experience – SDE Chennai

Regular Expression Matching

Find if a binary tree is height balanced ?

C Program for TAIL command of UNIX

Find min element in Sorted Rotated Array (With Duplicates)

The greedy coins game Dynamic Programming

Introduction To Number Theory ( Part 1 )

Length of the longest substring without repeating characters

Find the kth number with prime factors 3, 5 and 7

SAP Off Campus Hiring_ March 2015 Computer Skills

Find next greater number with same set of digits

Python Dictionaries

Cisco Hiring Event 21st – 22nd Feb 2015

Sort an array according to the order defined by another array

SAP Hiring Off-Campus General Aptitude

Binary Tree in Java

Facebook Interview Question : Interleave List

Count Possible Decodings of a given Digit Sequence

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

Print vertical sum of all the axis in the given binary tree

25 horses 5 tracks Find 3 fastest puzzle

C++ OOPs Part2

Copyright © 2025 · Genesis Framework · WordPress · Log in