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

3 problems found

Longest Substring Without Repeating Characters

#3
MediumSliding Window

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

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