🍎
Leetcode
  • README
  • Templates
    • interview_checklist
    • πŸ₯°beauty of python
    • online IDE templates
    • time complexity analysis
  • Data structures
    • bit_operation
    • deque
    • hashtable
    • linked_list
    • priority_queue
      • Arrangement
      • Sort+PQ
    • stack
    • string
    • intervals
    • trie
    • graph
    • tree
  • Algorithm
    • bfs
    • binary_search
    • dfs
    • topological sort
    • dynamic_programming
    • greedy
    • union_find
    • recursion
    • two_pointers
    • Offline processing
  • Other
    • design
    • everything
    • math
  • Company
    • Tree
    • BinarySearch
Powered by GitBook
On this page
  • BFS
  • Multi State
  • ζ‹“ζ‰‘ζŽ’εΊ
  • Dijkstra (BFS+PQ)
  1. Algorithm

bfs

  • BFS

    • Multi State

    • ζ‹“ζ‰‘ζŽ’εΊ

    • Dijkstra (BFS+PQ)

BFS

127.Word-Ladder (M+) 126.Word-Ladder-II (M+) 130.Surrounded-Regions (H-) 200.Number-of-Islands (H-) 529.Minesweeper (M+) 637.Average-of-Levels-in-Binary-Tree (M) 675.Cut-Off-Trees-for-Golf-Event (M) 694.Number-of-Distinct-Islands (M+) 785.Is-Graph-Bipartite (M+) 815.Bus-Routes (M+) 838.Push-Dominoes (M+) 847.Shortest-Path-Visiting-All-Nodes (H-) 864.Shortest-Path-to-Get-All-Keys (H-) 928.Minimize-Malware-Spread-II (H-) 1036.Escape-a-Large-Maze (H) 1245.Tree-Diameter (H) 1263.Minimum-Moves-to-Move-a-Box-to-Their-Target-Location (H) 1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination (H-) 1298.Maximum-Candies-You-Can-Get-from-Boxes (M+) 1311.Get-Watched-Videos-by-Your-Friends (M) 1345.Jump-Game-IV (M+) 1559.Detect-Cycles-in-2D-Grid (M) 1568.Minimum-Number-of-Days-to-Disconnect-Island (H-) 1617.Count-Subtrees-With-Max-Distance-Between-Cities (H-) 1654.Minimum-Jumps-to-Reach-Home (H-) 1905.Count-Sub-Islands (M+)

Multi State

913.Cat-and-Mouse (H+) 1728.Cat-and-Mouse-II (H+) 1928.Minimum-Cost-to-Reach-Destination-in-Time (H-)

ζ‹“ζ‰‘ζŽ’εΊ

207.Course-Schedule (H-) 210.Course-Schedule-II (M) 269.Alien-Dictionary (H-) 310.Minimum-Height-Trees (H-) 444.Sequence-Reconstruction (H) 802.Find-Eventual-Safe-States (H-) 1136.Parallel-Courses (M) 1203.Sort-Items-by-Groups-Respecting-Dependencies (H) 1462.Course-Schedule-IV (M) 1591.Strange-Printer-II (H-) 1857.Largest-Color-Value-in-a-Directed-Graph (H-)

Dijkstra (BFS+PQ)

743.Network-Delay-Time (H) 407.Trapping-Rain-Water-II (H) 778.Swim-in-Rising-Water (H) 505.The-Maze-II (H) 787.Cheapest-Flights-Within-K-Stops (H-) 882.Reachable-Nodes-In-Subdivided-Graph (H) 1066.Campus-Bikes-II (H+) 1879.Minimum-XOR-Sum-of-Two-Arrays (H) 1947.Maximum-Compatibility-Score-Sum (H) 1368.Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid (H) 1514.Path-with-Maximum-Probability (H) 1786.Number-of-Restricted-Paths-From-First-to-Last-Node (H-) 1810.Minimum-Path-Cost-in-a-Hidden-Grid (M+) 1976.Number-of-Ways-to-Arrive-at-Destination (H-)

PrevioustreeNextbinary_search

Last updated 3 years ago