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

11 problems found

Longest Substring Without Repeating

MediumSliding Window

Find longest substring without repeating...

O(n) / O(min(m, n))
Google, Amazon
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

Permutation in String

MediumSliding Window

Check if s1 permutation in s2...

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

Fruit Into Baskets

MediumSliding Window

Max fruit with at most 2 types...

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

Minimum Size Subarray Sum

MediumSliding Window

Find minimum length subarray with sum >= target...

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

Best Time to Buy and Sell Stock

EasySliding Window

Find max profit from one transaction...

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

Longest Repeating Character Replacement

MediumSliding Window

Max length after k character replacements...

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

Max Consecutive Ones III

MediumSliding Window

Max ones after flipping k zeros...

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

Substring with Concatenation of All Words

HardSliding Window

Find all substrings with concatenated words...

O(n*m) / O(m)
Google, Amazon

Minimum Window Substring

#76
HardSliding Window

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicat...

O(m + n) / O(m + n)
Google, Amazon

Sliding Window Maximum

#239
HardSliding Window

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You ca...

O(n) / O(min(m, n))
Google, Amazon

Longest Substring Without Repeating Characters

#3
MediumSliding Window

Given a string s, find the length of the longest substring without repeating characters....

O(n) / O(min(m, n))
Google, Amazon