Trees & Graphs

Conquer BFS, DFS, tree traversals, and graph algorithms — favorites at FAANG and top-tier companies.

10 exercises

mediumPython

Minimum Jumps to Reach End

# Minimum Jumps to Reach End Implement a function that finds the minimum number of jumps needed to reach the last index...

arraysgreedydynamic-programming+4

mediumPython

Word Search Solver

Build a function that solves a word search puzzle. Given a 2D board of letters and a target word, determine if the word...

backtracking

easyPython

Binary Search Implementation

Implement a binary search function that finds the index of a target value in a sorted array. **Function signature:** `b...

algorithms

hardPython

Binary Tree Serialization and Deserialization

Implement functions to serialize a binary tree to a string representation and deserialize it back to the original tree s...

binary-tree

mediumPython

Course Prerequisite Cycle Detection

Build a function that determines if you can finish all courses given a list of prerequisite pairs. This is a classic cyc...

graph-algorithms

mediumPython

Island Counter - 2D Grid Traversal

Write a function that counts the number of islands in a 2D binary grid. An island is surrounded by water and is formed b...

algorithms

mediumPython

Binary Tree Level Order Traversal

# Binary Tree Level Order Traversal Implement a function that performs level order traversal of a binary tree and retur...

binary-tree

mediumPython

Binary Search Tree Validator

# Binary Search Tree Validator Implement a function that determines if a binary tree is a valid binary search tree (BST...

binary-tree

easyPython

Binary Tree Maximum Depth

Write a function that finds the maximum depth (height) of a binary tree. The depth of a binary tree is the number of no...

binary-tree

easyPython

Invert Binary Tree

Write a function that inverts a binary tree (creates a mirror image) and returns the root node. Inverting a binary tree...

binary-tree