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

2 problems found

Binary Search

#704
EasyBinary Search

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists...

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

Search in Rotated Sorted Array

#33
MediumBinary Search

There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at a...

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