PrepFlow
Jobs
ATS Checker
Companies
DSA Sheets
Compiler
PrepFlow
Sign in
Login Required!
You need to log in to access your saved progress.
Companies
Google
Depth First Search
Depth First Search
0/90 solved
Number of Islands
MEDIUM
Binary Tree Maximum Path Sum
HARD
Lowest Common Ancestor of a Binary Tree
MEDIUM
Course Schedule
MEDIUM
Symmetric Tree
EASY
Invert Binary Tree
EASY
Diameter of Binary Tree
EASY
Binary Tree Inorder Traversal
EASY
Flatten Binary Tree to Linked List
MEDIUM
Binary Tree Right Side View
MEDIUM
Same Tree
EASY
Kth Smallest Element in a BST
MEDIUM
Lowest Common Ancestor of a Binary Search Tree
MEDIUM
All Nodes Distance K in Binary Tree
MEDIUM
Course Schedule II
MEDIUM
Serialize and Deserialize Binary Tree
HARD
Max Area of Island
MEDIUM
Populating Next Right Pointers in Each Node
MEDIUM
Clone Graph
MEDIUM
Evaluate Division
MEDIUM
Longest Increasing Path in a Matrix
HARD
Surrounded Regions
MEDIUM
Merge Two Binary Trees
EASY
Flood Fill
EASY
Design Add and Search Words Data Structure
MEDIUM
Pacific Atlantic Water Flow
MEDIUM
Minimum Depth of Binary Tree
EASY
Binary Tree Postorder Traversal
EASY
Range Sum of BST
EASY
Accounts Merge
MEDIUM
Binary Tree Paths
EASY
Path With Minimum Effort
MEDIUM
Reconstruct Itinerary
HARD
Most Stones Removed with Same Row or Column
MEDIUM
Find Duplicate Subtrees
MEDIUM
Trim a Binary Search Tree
MEDIUM
Sum of Distances in Tree
HARD
Shortest Bridge
MEDIUM
Binary Tree Cameras
HARD
Deepest Leaves Sum
MEDIUM
Possible Bipartition
MEDIUM
Delete Nodes And Return Forest
MEDIUM
Number of Closed Islands
MEDIUM
Alien Dictionary
HARD
Minimum Absolute Difference in BST
EASY
Number of Enclaves
MEDIUM
Time Needed to Inform All Employees
MEDIUM
Making A Large Island
HARD
Find Mode in Binary Search Tree
EASY
Graph Valid Tree
MEDIUM
Flip Equivalent Binary Trees
MEDIUM
Maximum Depth of N-ary Tree
EASY
Convert Binary Search Tree to Sorted Doubly Linked List
MEDIUM
Number of Good Leaf Nodes Pairs
MEDIUM
Couples Holding Hands
HARD
Battleships in a Board
MEDIUM
Smallest String Starting From Leaf
MEDIUM
Employee Importance
MEDIUM
Design Search Autocomplete System
HARD
Minesweeper
MEDIUM
Kth Ancestor of a Tree Node
HARD
Sort Items by Groups Respecting Dependencies
HARD
Water and Jug Problem
MEDIUM
Binary Tree Coloring Game
MEDIUM
The Maze II
MEDIUM
Count Servers that Communicate
MEDIUM
Longest Absolute File Path
MEDIUM
Path With Maximum Minimum Value
MEDIUM
Closest Binary Search Tree Value II
HARD
Count Univalue Subtrees
MEDIUM
Binary Tree Longest Consecutive Sequence II
MEDIUM
Binary Tree Longest Consecutive Sequence
MEDIUM
Serialize and Deserialize N-ary Tree
HARD
Find Elements in a Contaminated Binary Tree
MEDIUM
Tree Diameter
MEDIUM
Minimize Hamming Distance After Swap Operations
MEDIUM
Frog Position After T Seconds
HARD
Escape a Large Maze
HARD
Cracking the Safe
HARD
Smallest Rectangle Enclosing Black Pixels
HARD
The Maze III
HARD
Find Root of N-Ary Tree
MEDIUM
Mini Parser
MEDIUM
Tree of Coprimes
HARD
Correct a Binary Tree
MEDIUM
Shortest Path in a Hidden Grid
MEDIUM
Check If Two Expression Trees are Equivalent
MEDIUM
Minimum Path Cost in a Hidden Grid
MEDIUM
Change the Root of a Binary Tree
MEDIUM
Move Sub-Tree of N-Ary Tree
HARD