Coders Crushby Napplied AI

Data Structures & Algorithms

100+ curated problems from top tech interviews

All Arrays & Hashing Two Pointers Sliding Window

Coders Crushby Napplied AI

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

System Design

All Problems
Easy
Hard

DSA

All Problems
Dynamic Programming
Graphs

More

Problems Arena
Growth Paths
AI Discovery

Coders Crush by Napplied AI - Built for engineers preparing for FAANG/MAANG interviews

Heap / Priority Queue

Dynamic Programming

Math & Geometry

Bit Manipulation

3 problems found

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....

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...