Coders Crushby Napplied AI

Data Structures & Algorithms

100+ curated problems from top tech interviews

AllArrays & HashingTwo PointersSliding 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

Stack & Queue
Binary Search
Linked Lists
Trees
Tries
Heap / Priority Queue
Graphs
Dynamic Programming
Backtracking
Greedy
Intervals
Math & Geometry
Bit Manipulation

4 problems found

Valid Palindrome

#125
EasyTwo Pointers

A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the ...

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

3Sum

#15
MediumTwo Pointers

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k]...

O(n²) / O(1)
Google, Amazon

Container With Most Water

#11
MediumTwo Pointers

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, hei...

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

Trapping Rain Water

#42
HardTwo Pointers

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining....

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