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

9 problems found

Koko Eating Bananas

MediumBinary Search

Find min eating speed for h hours...

O(n*log m) / O(1)

Google, Facebook

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

Search Insert Position

EasyBinary Search

Find position to insert target...

O(log n) / O(1)

Google, Facebook

Time Based Key-Value Store

MediumBinary Search

Query key value at timestamp...

O(log n) / O(n)

First Bad Version

EasyBinary Search

Find first bad version...

O(log n) / O(1)

Google, Facebook

Search in Rotated Sorted Array

MediumBinary Search

Find target in rotated array...

O(n log n) / O(n)

Google, Microsoft

Median of Two Sorted Arrays

HardBinary Search

Find median of two sorted arrays...

O(n log n) / O(n)

Google, Microsoft

Find First and Last Position

MediumBinary Search

Find range of target in sorted array...

O(log n) / O(1)

Google, Microsoft

Binary Search

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)

Search in Rotated Sorted Array

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(n log n) / O(n)