Hrishikesh Mishra

A Code Artist

Skip to content
  • Data Structure and Algorithm
    • String
      • String All Question
    • Array
      • Array Questions
    • Linked List
      • All Linked List Questions
    • Stack
      • All Stack Question
    • Queue
      • All Queue Questions
    • Binary Tree
      • All Binary Tree Questions
    • Binary Search Tree (BST)
      • All BST Questions
    • Heap
      • All Heap Questions
    • Hash
      • All Hash Questions
    • Graph
      • Graph All Questions
    • Matrix
      • Matrix Questions
    • Dynamic Programming
      • Dynamic Programming Questions
    • Recursion
      • Recursion Questions
    • Bit
      • Bit Question
    • Mixed
      • Mixed Question
    • Divide And Conquer
      • Divide And Conquer Questions
    • Sort
      • Sort Questions
  • Design Pattern
  • Database
  • Random
  • About Me

Graph Questions

  • Prim’s Minimum Spanning Tree
  • N Queen Problem Using Backtracking Algorithm
  • Minimum Spanning Tree Using Kruskal’s algorithm
  • Find the maximum flow using Ford Fulkerson Method Edmond Karp’s Algorithm.
  • Find the number of islands
  • Strongly Connected Components by Kosaraju’s algorithm
  • Articulation Points Graph Algorithm using torjan’s algorithm (Cut Vertices)
  • Graph Vertices Coloring
  • Floyd Warshall Algorithm to find shortest path weighted directed Graph.
  • Implement Dijkstra
  • Snake and Ladder Problem
  • Find all possible words in a board of characters (Boggle)
  • Topological Sorting
  • Minimize Cash Flow among a given set of friends who have borrowed money from each other
  • Detect cycle in an undirected graph
  • Detect Cycle in a Directed Graph
  • Longest Path in a Directed Acyclic Graph with weight
  • Check whether a given graph is Bipartite or not
  • Longest Path in a Directed Acyclic Graph
  • Implement Depth First Traversal for a Graph
  • Implement Breadth First Traversal for a Graph
  • T9 Dictionary Using DFS
  • Duplicate Baby Names Problem
  • Count paths between two vertices in undirected graph
  • Kruskal Minimum spanning tree based on disjoint set
  • Detect Cycle in a Directed Graph
  • Alien Language Parser
  • Prim’s Minimum Spanning Tree
  • Dijkstra Shortest Path Finder
  • Topological Sort
  • Graph Depth first search traversal (DFS)
  • Breadth first search traversal (BFS)
  • Adjacency Matrix Graph Implementation
  • Adjacency List Graph Implementation
  • Hamiltonian Cycle
Facebook

Recent Posts

  • Suffix Array Implementation
  • Generate possible strings that can be made by placing spaces.
  • Longest Repeated Substring (using Suffix Array)
  • Lexicographic Order
  • Reverse Quick Sort

Archives

  • April 2017
  • March 2017
  • February 2017
  • January 2017
  • December 2016
  • November 2016
  • October 2016
  • July 2016
  • January 2016
  • October 2013
Proudly powered by WordPress