Coders Crushby Napplied AI

Data Structures & Algorithms

100+ curated problems from top tech interviews

All Arrays & Hashing Two Pointers Sliding Window Stack & Queue Binary Search Linked Lists Trees Tries Heap / Priority Queue Graphs Dynamic Programming Backtracking Greedy Intervals Math & Geometry Bit Manipulation

14 problems found

Level Order Traversal

BFS level by level...

O(V + E) / O(V)

Binary Tree Maximum Path Sum

Coders Crushby Napplied AI

The ultimate interview preparation platform. Master System Design, DSA, and tackle community challenges to crush your FAANG interviews.

Looking for jobs? Visit Napplied AI Jobs Search Agent

System Design

All Problems
Easy
Hard

DSA

All Problems
Dynamic Programming
Graphs

More

Problems Arena
Growth Paths
My Crush

Coders Crush by Napplied AI - Tech Interview & Coding Should Be Effortless

HardTrees

Find max sum path in tree...

O(n) / O(h)

Google, Amazon

Serialize and Deserialize Binary Tree

Convert tree to/from string...

Construct Binary Tree from Preorder and Inorder

Build tree from traversals...

Path Sum

Check if root-leaf path equals target...

Google, Microsoft

Inorder Traversal

Inorder tree traversal...

Maximum Depth of Binary Tree

Find max depth of tree...

Same Tree

Check if two trees are same...

O(min(m,n)) / O(min(h1,h2))

Lowest Common Ancestor of BST

Find LCA in binary search tree...

Binary Tree Right Side View

Get rightmost nodes at each level...

Validate Binary Search Tree

Check if tree is valid BST...

O(log n) / O(1)

Binary Tree Maximum Path Sum

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. The path sum of a path i...

Invert Binary Tree

Given the root of a binary tree, invert the tree, and return its root....

Lowest Common Ancestor of BST

Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST....