Coders Crushby Napplied AI

Data Structures & Algorithms

100+ curated problems from top tech interviews

AllArrays & HashingTwo PointersSliding WindowStack & QueueBinary SearchLinked ListsTreesTriesHeap / Priority QueueGraphsDynamic ProgrammingBacktrackingGreedyIntervalsMath & GeometryBit Manipulation

3 problems found

Invert Binary Tree

#226
EasyTrees

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

O(n) / O(h)
Google, Amazon
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

Lowest Common Ancestor of BST

#235
MediumTrees

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

O(h) / O(1)
Google, Amazon

Binary Tree Maximum Path Sum

#124
HardTrees

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

O(n) / O(h)
Google, Amazon