All DSA
Interview Guide

Graphs

0%
Coding
Theory

  • Add Edges to Make Degrees of All Nodes Even

    Mid

  • All Paths From Source to Target

    Mid

  • Ancestor Graph (Zero/One Parent Nodes)

    Mid

  • BFS Subtree Count in Graph

    Mid

  • BFS Traversal on Adjacency List

    Mid

  • BFS/DFS Traversal

    Mid

  • Build System Dependency

    Mid

  • Central Management Hub

    Mid

  • Cheapest Flights Within K Stops

    Mid

  • Circular References in JSON

    Mid

  • Cleaning Robot Reachable Cells

    Mid

  • Clone Graph

    Mid

  • Coloring A Border

    Mid

  • Connected Components in a Graph (Company Mergers)

    Mid

  • Corporate Conglomerates

    Mid

  • Course Schedule

    Mid

  • Course Schedule II

    Mid

  • Cycle Detection in Dependencies

    Mid

  • Cycle Detection in Package Manager

    Mid

  • Dependency Graph Cycle Detection

    Mid

  • Detect Circular Dependency

    Mid

  • Detect Cycle in an Undirected Graph

    Mid

  • Distance to a Cycle in Undirected Graph

    Mid

  • Divide Colored Balls with Sticks (Bipartite Graph)

    Mid

  • DSU with Metadata

    Mid

  • Earliest Moment When Everyone Become Friends

    Mid

  • File System Master Page Recovery

    Mid

  • Find the Node with the Highest Edge Score in a Graph

    Mid

  • Flight Dependencies

    Mid

  • Graph Level Order Traversal

    Mid

  • Graph Traversal with Constraints

    Mid

  • Grid Escape with Shifting Walls and Teleporters

    Mid

  • Hierarchical Management

    Mid

  • Hops to Reach Destination

    Mid

  • Is Graph Bipartite?

    Mid

  • Itinerary Planner

    Mid

  • Jump Game III

    Mid

  • Keys and Rooms

    Mid

  • Maze Solver with Constraints

    Mid

  • Maze with Portals

    Mid

  • Min Cost to Connect All Points

    Mid

  • Minimum Cost to Reach City With Discounts

    Mid

  • Minimum Knight Moves

    Mid

  • Minimum Latency Path in Microservices

    Mid

  • Network Delay Time

    Mid

  • Number of Connected Components in an Undirected Graph

    Mid

  • Number of Islands

    Mid

  • Number of Nodes in the Sub-Tree With the Same Label

    Mid

  • Number of Provinces

    Mid

  • Open the Lock

    Mid

  • Optimal Commute on 2D Grid

    Mid

  • Pacific Atlantic Water Flow

    Mid

  • Parallel Courses

    Mid

  • Path With Maximum Minimum Value

    Mid

  • Pathfinding Puzzle Minimum Rotations

    Mid

  • Pin Board Connectivity

    Mid

  • Pixel Island Count

    Mid

  • Reachable Nodes In Subdivided Graph

    Mid

  • Redundant Connection

    Mid

  • Referral Program Leaderboard

    Mid

  • Rotting Oranges

    Mid

  • Service Dependency Graph

    Mid

  • Shortest Path between Stations

    Mid

  • Shortest Path Edge Participation

    Mid

  • Shortest Path from Multiple Sources to Destination

    Mid

  • Shortest Path in 2D Cost Matrix

    Mid

  • Shortest Path in a Bidirectional Graph

    Mid

  • Shortest Path in a Game Map

    Mid

  • Shortest Path in a Grid (BFS)

    Mid

  • Shortest Path in a Weighted Graph

    Mid

  • Shortest Path in Binary Matrix

    Mid

  • Single Domain Web Crawler

    Mid

  • Sneak Path

    Mid

  • Social Payment Graph Cycle Detection

    Mid

  • Task Execution Order

    Mid

  • The Maze II

    Mid

  • TV Channel Navigation

    Mid

  • Web Crawler

    Mid

  • Word Chaining

    Mid

  • Word Ladder - Find Shortest Transformation Sequence

    Mid

  • Zero or One Parent

    Mid

  • A* Pathfinding in a Grid

    Senior

  • Alien Dictionary

    Senior

  • Arbitrage Detection

    Senior

  • BFS Maze Solver with Keys and Teleporters

    Senior

  • Bus Routes

    Senior

  • Cat and Mouse

    Senior

  • Circular Sequence from Pairs

    Senior

  • Constrained Monster Traversal

    Senior

  • Critical Connections in a Network

    Senior

  • DNA Sequence Reconstruction

    Senior

  • Entrance to Vault Paths

    Senior

  • Fastest Transportation Mode

    Senior

  • Graph Traversal with Thresholds

    Senior

  • Graph Valid Tree

    Senior

  • Linked User Similarity Scoring

    Senior

  • Maze Treasure Hunter

    Senior

  • Minimize Path Value (Minimax Path in Graph)

    Senior

  • Minimum Cost Path with Edge Reversals

    Senior

  • Minimum Edge Reversals So Every Node Is Reachable

    Senior

  • Number of Connected Components in an Undirected Graph

    Senior

  • Number of Islands (Infinite Grid)

    Senior

  • Number of Islands II

    Senior

  • Parallel Courses III

    Senior

  • Path Optimization Graph

    Senior

  • Rat, Bread, and Cat (Max-Min Distance)

    Senior

  • Reconstruct Itinerary

    Senior

  • Resilient Network

    Senior

  • Service Orchestration Log

    Senior

  • Shortest Distance from All Buildings

    Senior

  • Shortest Path in a Grid with Obstacles Elimination

    Senior

  • Shortest Path to Get All Keys

    Senior

  • Shortest Path Visiting All Nodes

    Senior

  • Shortest Path with Dynamic Edge Weights

    Senior

  • Sliding Puzzle

    Senior

  • Swim in Rising Water

    Senior

  • Word Ladder II - Find All Shortest Transformation Sequences

    Senior