Innoskrit
Innoskrit
  • Home
  • About
  • Courses
    • Live Courses
    • Recorded Courses
  • Blog
  • Campus Programs
  • More
    • Success Stories
    • Contact
Innoskrit
About this Course HTML and CSS Are the Tools You Need to Build a Website Coding for beginners might seem hard. However, starting with the basics is a great way.
  • turitor@admin.com
  • +01145928421

Login

Lost your password?

Register

Category: Graph

  1. Home
  2. /
  3. Graph
Innoskrit April 18, 2022 Graph, Shortest Path Algorithm

Dijkstra’s Algorithm – Single Source Shortest Path

Problem Statement: Given a weighted graph, find the shortest path between any two vertices of a graph. Code: Adjacency Matrix […]

Continue
Innoskrit April 13, 2022 Graph, TCS Codevita, Topological Sort

Testvita – Codevita 2019 – Round 2

Problem Statement: TCS is working on a new project called “Testvita“. There are N modules in the project. Each module […]

Continue
Innoskrit April 11, 2022 Depth First Search, Graph

Detect Cycle in an Undirected Graph Using DFS

Problem Statement: Given an undirected Graph, write an algorithm that returns True if the graph contains a cycle, otherwise False. […]

Continue
Innoskrit April 10, 2022 Graph, Topological Sort

Alien Dictionary (Hard)

There is a new alien language that uses the English alphabet. However, the order among the letters is unknown to […]

Continue
Innoskrit April 9, 2022 Graph, Topological Sort

Course Schedule I: LeetCode

Problem Statement: There are a total of numCourses courses you have to take, labeled from 0 to numCourses – 1. You are given an array prerequisites where prerequisites[i] […]

Continue
Innoskrit April 8, 2022 Graph, Topological Sort

Topological Ordering

Problem Statment: Topological Sort of a directed graph (a graph with unidirectional edges) is a linear ordering of its vertices such […]

Continue
Innoskrit April 8, 2022 Breadth First Search, Graph

Bus Routes: LeetCode

Problem Statement: You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever. For example, if routes[0] […]

Continue
Innoskrit April 7, 2022 Breadth First Search, Graph

Snakes and Ladders: LeetCode

Problem Statement: You are given an n x n integer matrix board where the cells are labeled from 1 to n2 in a Boustrophedon style starting from the bottom left […]

Continue
Innoskrit April 6, 2022 Graph

Graph Representation Using Adjacency List – II

CODE Output: Adjacency List of Undirected Graph Delhi => Mumbai Bangalore Mumbai => Delhi Hyderabad Bangalore Bangalore => Delhi Mumbai […]

Continue
Innoskrit April 6, 2022 Graph

Graph Representation Using Adjacency List – I

Java Code Output: Adjacency List of Undirected Graph 0 => 1 2 1 => 0 3 2 => 0 3 […]

Continue

Recent Posts

  • Best Team With No Conflicts
  • Wine and Maximum Price Problem
  • Reorganize String II
  • Reorganize String
  • K Closest Points to the Origin

Categories

  • Backtracking (1)
  • Binary Tree (1)
  • Breadth First Search (1)
  • Breadth First Search (2)
  • Depth First Search (1)
  • Dynamic Programming (3)
  • Graph (10)
  • Innoskrit Masterclass DSA Sheet (17)
  • Interview Experience (3)
  • Linked List (1)
  • Priority Queue (Heap) (5)
  • Shortest Path Algorithm (1)
  • Sliding Window Pattern (2)
  • Stack (1)
  • TCS Codevita (2)
  • Topological Sort (4)
  • Two Pointers (9)
  • Uncategorized (1)
  • Walmart Global Tech (1)

Important Links

  • About Us
  • Careers - We're hiring!
  • Courses

Important Links

  • About Us
  • Blogs
  • Courses

Company

  • Terms and Conditions
  • Privacy Policy
  • Pricing Policy

The unexamined life is not worth living.

~Socrates

Get in touch!

  • Contact Us
Innoskrit

Copyright © 2022 Innoskrit. All Right Reserved.

  • About Us
  • Blogs
  • Courses