PrepFlow
Jobs
ATS Checker
Companies
DSA Sheets
Compiler
PrepFlow
Sign in
Login Required!
You need to log in to access your saved progress.
Companies
Amazon
Depth First Search
Depth First Search
0/116 solved
Number of Islands
MEDIUM
Validate Binary Search Tree
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
Maximum Depth of Binary Tree
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
Path Sum III
MEDIUM
Balanced Binary Tree
EASY
Course Schedule II
MEDIUM
Serialize and Deserialize Binary Tree
HARD
Cheapest Flights Within K Stops
MEDIUM
Max Area of Island
MEDIUM
Number of Provinces
MEDIUM
Path Sum
EASY
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
House Robber III
MEDIUM
Flood Fill
EASY
Subtree of Another Tree
EASY
Binary Tree Preorder Traversal
EASY
Path Sum II
MEDIUM
Recover Binary Search Tree
MEDIUM
Vertical Order Traversal of a Binary Tree
HARD
Design Add and Search Words Data Structure
MEDIUM
Network Delay Time
MEDIUM
Pacific Atlantic Water Flow
MEDIUM
Minimum Depth of Binary Tree
EASY
All Paths From Source to Target
MEDIUM
Binary Tree Postorder Traversal
EASY
Accounts Merge
MEDIUM
Critical Connections in a Network
HARD
Redundant Connection
MEDIUM
Keys and Rooms
MEDIUM
Reconstruct Itinerary
HARD
Count Good Nodes in Binary Tree
MEDIUM
Find Eventual Safe States
MEDIUM
Populating Next Right Pointers in Each Node II
MEDIUM
Find Duplicate Subtrees
MEDIUM
Distribute Coins in Binary Tree
MEDIUM
Convert BST to Greater Tree
MEDIUM
Number of Operations to Make Network Connected
MEDIUM
Flatten Nested List Iterator
MEDIUM
Possible Bipartition
MEDIUM
Delete Nodes And Return Forest
MEDIUM
Number of Closed Islands
MEDIUM
Binary Tree Pruning
MEDIUM
Alien Dictionary
HARD
Increasing Order Search Tree
EASY
Leaf-Similar Trees
EASY
Cousins in Binary Tree
EASY
Making A Large Island
HARD
Concatenated Words
HARD
Maximum Level Sum of a Binary Tree
MEDIUM
Minimum Distance Between BST Nodes
EASY
Serialize and Deserialize BST
MEDIUM
Sum of Root To Leaf Binary Numbers
EASY
Graph Valid Tree
MEDIUM
Binary Tree Vertical Order Traversal
MEDIUM
Pseudo-Palindromic Paths in a Binary Tree
MEDIUM
Find Leaves of Binary Tree
MEDIUM
All Elements in Two Binary Search Trees
MEDIUM
Maximum Product of Splitted Binary Tree
MEDIUM
Linked List in Binary Tree
MEDIUM
Maximum Depth of N-ary Tree
EASY
Sum of Nodes with Even-Valued Grandparent
MEDIUM
Delete Leaves With a Given Value
MEDIUM
Maximum Sum BST in Binary Tree
HARD
Number of Connected Components in an Undirected Graph
MEDIUM
N-ary Tree Postorder Traversal
EASY
Convert Binary Search Tree to Sorted Doubly Linked List
MEDIUM
Inorder Successor in BST
MEDIUM
Redundant Connection II
HARD
Most Frequent Subtree Sum
MEDIUM
Number of Distinct Islands
MEDIUM
Design Search Autocomplete System
HARD
Minesweeper
MEDIUM
The Maze
MEDIUM
Closest Binary Search Tree Value
EASY
Nested List Weight Sum
MEDIUM
Recover a Tree From Preorder Traversal
HARD
Course Schedule IV
MEDIUM
Boundary of Binary Tree
MEDIUM
Loud and Rich
MEDIUM
The Maze II
MEDIUM
Count Servers that Communicate
MEDIUM
Longest Absolute File Path
MEDIUM
Detect Cycles in 2D Grid
MEDIUM
Serialize and Deserialize N-ary Tree
HARD
Sentence Similarity II
MEDIUM
Maximum Average Subtree
MEDIUM
Coloring A Border
MEDIUM
Insufficient Nodes in Root to Leaf Paths
MEDIUM
Two Sum BSTs
MEDIUM
Pyramid Transition Matrix
MEDIUM
Equal Tree Partition
MEDIUM
Lowest Common Ancestor of a Binary Tree IV
MEDIUM
Find Distance in a Binary Tree
MEDIUM
Clone N-ary Tree
MEDIUM
Throne Inheritance
MEDIUM
Web Crawler
MEDIUM
Number of Distinct Islands II
HARD
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
MEDIUM