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

16 challenges available

Maximum Score Removing Substrings

You are given a string s and two integers x and y. You can perform two types of operations any number of times....

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

Distinct Subsequences II

Given a string s, return the number of distinct non-empty subsequences of s. Since the answer may be very large, return ...

Num Longest Increasing Subsequence

Given an integer array nums, return the number of longest increasing subsequences....

Concatenated Words

Given an array of strings words (without duplicates), return all the concatenated words in the given list of words....

Paint House II

There are n houses and k colors. You need to paint all the houses such that no two adjacent houses have the same color....

Stone Game IV

Alice and Bob take turns playing a game, with Alice starting first. There are n stones in a pile, and the goal of the ga...

Minimum Path Cost Grid

You are given a 0-indexed m x n integer matrix grid consisting of positive integers. You can move in four directions: up...

Maximum Alternating Subsequence Sum

The alternating sum of a sequence is defined as the sum of elements at even indices minus the sum of elements at odd ind...

Maximum Sum Circular Subarray

Given a circular integer array nums of length n, return the maximum sum of a non-empty subarray of nums....

Distinct Subsequences III

Given a string s, return the number of distinct subsequences of s where all the characters of the subsequence are unique...

Profitable Schemes

There is a group of n members, and a list of some crimes they could commit. The ith crime generates a profit[i] and requ...

Longest Increasing Path Matrix

Given an m x n integers matrix, return the length of the longest increasing path in matrix. From each cell, you can eith...

Word Break III

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct ...

Minimum Cost Tickets

In a country popular for train travels, you have planned some train traveling one year in advance. The days of the year ...

Best Time Buy Sell Stock IV

You are given an integer array prices where prices[i] is the price of a given stock on the ith day, and an integer k....

Interleaving Strings

Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2. An interleaving of two strings ...