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

12 problems found

Maximum Subarray

MediumDynamic Programming

Find max sum contiguous subarray...

Decode Ways

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

MediumDynamic Programming

Number of ways to decode string...

O(n) / O(1)

Google, Amazon

Burst Balloons

HardDynamic Programming

Maximum coins from bursting balloons...

O(n³) / O(n²)

Jump Game

MediumDynamic Programming

Can reach last index...

House Robber

MediumDynamic Programming

Maximum sum without adjacent elements...

Coin Change II

MediumDynamic Programming

Number of ways to make amount...

Unique Paths

MediumDynamic Programming

Number of paths in grid...

Longest Increasing Subsequence

MediumDynamic Programming

Given an integer array nums, return the length of the longest strictly increasing subsequence....

O(n log n) / O(n)

Coin Change

MediumDynamic Programming

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return ...

O(amount * n) / O(amount)

Word Break

MediumDynamic Programming

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary wor...

O(n² * m) / O(n)

Climbing Stairs

EasyDynamic Programming

You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb ...

Edit Distance

MediumDynamic Programming

Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. You have the following three operations...