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!

AllAI/DevToolsAdTechAlgorithm DesignAnalyticsArchitectureBlockchainBlockchain/SecurityCloudCode AnalysisCode Analysis/MLCompilersCryptographyDPData EngineeringData StructuresDatabasesDevOpsDevToolsDistributed SystemsEdTech/MLEvolutionary ComputingFormal MethodsGame AIGame DevGraph AlgorithmsGraphQLGraphsInfrastructureMLML EthicsML InfrastructureML/AnalyticsML/AudioML/Document AIML/NLPMathematical PuzzlesNLPNLP/MLObservabilityOptimizationPerformancePrivacyQuantum ComputingReal-time SystemsResilienceRoboticsSRESchedulingScheduling AlgorithmsSecurityServerlessStringsSyncSystem DesignTestingVisualizationWeb Development

15 challenges available

Number of Islands II

HardGraphs

Given a 2D grid of empty land and island (0 and 1), dynamically add islands one by one and count total connected compone...

0
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

Alien Dictionary

HardGraphs

There is a new alien language which uses the latin alphabet. You are given a list of words written in this alien languag...

0
0 solutions
System

Minimum Cost Connect Points

HardGraphs

You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi]....

0
0 solutions
System

Swim in Rising Water

HardGraphs

You are given an n x n integer matrix grid where you are located at the top-left corner (0, 0) and must reach the bottom...

0
0 solutions
System

Parallel Courses III

HardGraphs

You are given an integer n which indicates that there are n courses labeled from 1 to n. You are also given an array rel...

0
0 solutions
System

Accounts Merge

HardGraphs

Given a list of accounts where each element accounts[i] is a list of strings, where the first element accounts[i][0] is ...

0
0 solutions
System

Maximum Network Rank

MediumGraphs

There is an infrastructure of n cities with some number of roads connecting these cities. Each connected pair of cities ...

0
0 solutions
System

Graph Bipartition

MediumGraphs

There is an undirected graph with n nodes where each node is labeled from 1 to n. You are given a 2D array graph where g...

0
0 solutions
System

Reorder Routes for City Zero

MediumGraphs

There are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two differ...

0
0 solutions
System

Shortest Path Binary Matrix

MediumGraphs

Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path...

0
0 solutions
System

Minimum Height Trees

MediumGraphs

A tree is an undirected graph in which any two nodes are connected by exactly one path. In other words, any connected gr...

0
0 solutions
System

Network Delay Time

MediumGraphs

You are given a network of n nodes labeled from 1 to n. You are also given times, a list of travel times as directed edg...

0
0 solutions
System

Path With Maximum Probability

MediumGraphs

You are given an undirected weighted graph of n nodes (0-indexed), represented by an edge list where edges[i] = [a, b] i...

0
0 solutions
System

All Paths Source to Target

MediumGraphs

Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all paths from node 0 to node n - 1 and re...

0
0 solutions
System

Reconstruct Itinerary

HardGraphs

You are given a list of airline tickets where tickets[i] = [fromi, toi] represent a ticket from airport fromi to airport...

0
0 solutions
System