Coders Crushby Napplied AI

Problems Arena

Community-driven challenges - No solutions shown!

These are interesting problems with no solutions shown. Submit your own solutions or problems to contribute!

All AI/DevTools AdTech Algorithm Design Analytics Architecture Blockchain Blockchain/Security Cloud Code Analysis Code Analysis/ML Compilers Cryptography DP Data Engineering Data Structures Databases DevOps DevTools Distributed Systems EdTech/ML Evolutionary Computing Formal Methods Game AI Game Dev Graph Algorithms GraphQL Graphs Infrastructure ML ML Ethics ML Infrastructure ML/Analytics ML/Audio ML/Document AI ML/NLP Mathematical Puzzles NLP NLP/ML Observability Optimization Performance Privacy Quantum Computing Real-time Systems Resilience Robotics SRE Scheduling Scheduling Algorithms Security Serverless Strings Sync System Design Testing Visualization Web Development

10 challenges available

Median Data Stream

HardData Structures

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value and...

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

0 solutions

System

LRU Cache Implementation

MediumData Structures

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class....

Min Stack

EasyData Structures

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time....

Range Sum Query Mutable

MediumData Structures

Given an integer array nums, handle multiple queries of the following types: Update the value of an element in nums....

Count Range Sum

HardData Structures

Given an integer array nums and two integers lower and upper, return the number of range sums that lie in [lower, upper]...

Binary Indexed Tree

MediumData Structures

Given an integer array nums, handle multiple queries of type: Update the value of an element in nums. Calculate the sum ...

Maximal Square

MediumData Structures

Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area....

Trie Autocomplete

HardData Structures

Implement an autocomplete system. For each query, return a list of the top 3 most recent and frequent search sentences....

Binary Search Tree Iterator

MediumData Structures

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Ca...

Skyline Problem

HardData Structures

A city's skyline is formed by the outer contours of silhouettes formed by all the buildings. Given the locations and hei...