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

9 challenges available

Shortest Palindrome KMP

You are given a string s. You can convert s to a palindrome by adding characters in front of it....

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

Text Justification

Given an array words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fu...

Substring Concatenation Words

You are given a string s and an array of strings words. All the strings of words are of the same length. Return all star...

Generate Parentheses

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses....

Decode Ways II

A message containing letters from A-Z can be encoded into numbers using a mapping. A-Z is mapped to 1-26. However, this ...

Word Pattern II

Given a pattern and a string s, find if s follows the same pattern. Here follow means a full match, such that there is a...

Minimum Window Substring II

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every char...

Regular Expression Matcher II

Implement a regular expression matcher that supports . (matches any single character) and * (matches zero or more of the...

Longest Valid Parentheses

Given a string containing just the characters ( and ), find the length of the longest valid (well-formed) parentheses su...