Skip to main content
DevEval
LibraryPractice
  1. Problems
  2. Depth-First Search

Topic

Depth-First Search problems

27 problems: 2 Easy, 14 Medium, 11 Hard.

Easy (2)

  • Path Sum
  • Flood Fill

Medium (14)

  • Number of Islands
  • Pacific Atlantic Water Flow
  • Surrounded Regions
  • Path Sum II
  • Number of Provinces
  • Max Area of Island
  • Path Sum III
  • All Paths From Source to Target
  • Keys and Rooms
  • Triangle Minimum Path Sum
  • Minesweeper
  • Tree Diameter
  • Count Nodes With the Highest Score
  • Time Needed to Inform All Employees

Hard (11)

  • Binary Tree Maximum Path Sum
  • Reconstruct Itinerary
  • Concatenated Words
  • Critical Connections in a Network
  • Longest Increasing Path in a Matrix
  • Longest Path With Different Adjacent Characters
  • Sum of Distances in Tree
  • Count Ways to Build Rooms in an Ant Colony
  • Articulation Points Count
  • Count Paths in DAG
  • Minimum Vertex Cover on Tree

Other topics

  • Array414
  • Math223
  • String204
  • Dynamic Programming142
  • Hash Table125
  • SQL116
  • Tree93
  • Matrix83
  • Sorting83
  • Simulation66
  • Greedy65
  • Binary Search61
  • Machine Learning59
  • Two Pointers57
  • Stack50
  • Graph49
  • Data Engineering48
  • Bit Manipulation47
  • Heap47
  • Sliding Window44
  • Prefix Sum42
  • Aggregation38
  • Design37
  • Backtracking32
  • Linked List32
  • Breadth-First Search30
  • Combinatorics25
  • Statistics25
  • Number Theory24
  • Binary Search Tree23
  • Intervals23
  • Joins18
  • Divide and Conquer17
  • Union Find17
  • Geometry16
  • Recursion16
  • Backend Systems12
  • String Matching12
  • Data Integrity11
  • Shortest Path11
  • Queue10
  • Subqueries9
  • Topological Sort9
  • Trie7
  • Game Theory6
  • Window Functions6
  • API3
  • Brainteaser3
  • Probability3
  • Reliability3
Library
Practice
Create free account