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

5 problems found

Climbing Stairs

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

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

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

Longest Increasing Subsequence

#300
MediumDynamic Programming

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

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

Word Break

#139
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)
Google, Amazon

Coin Change

#322
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)
Google, Amazon

Edit Distance

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

O(mn) / O(mn)
Google, Amazon