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

9 problems found

Number of Recent Calls

EasyStack & Queue

Recent request count in range...

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

Valid Parentheses

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

EasyStack & Queue

Check if parentheses are valid...

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

Implement Queue using Stacks

EasyStack & Queue

Queue using two stacks...

O(n) / O(n)
Google, Microsoft

Min Stack

MediumStack & Queue

Stack supporting min queries...

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

Simplify Path

MediumStack & Queue

Simplify Unix file path...

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

Evaluate Reverse Polish Notation

MediumStack & Queue

Evaluate RPN expression...

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

Daily Temperatures

MediumStack & Queue

Days until warmer temperature...

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

Largest Rectangle in Histogram

HardStack & Queue

Largest rectangle in histogram...

O(n) / O(n)
Google, Microsoft

LRU Cache

#146
MediumStack & Queue

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class with get and put operations in...

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