Coders Crushby Napplied AI

Data Structures & Algorithms

100+ curated problems from top tech interviews

All Arrays & Hashing Two Pointers Sliding Window

Coders Crushby Napplied AI

The ultimate interview preparation platform. Master System Design, DSA, and tackle community challenges to crush your FAANG interviews.

System Design

All Problems
Easy
Hard

DSA

All Problems
Dynamic Programming
Graphs

More

Problems Arena
Growth Paths
AI Discovery

Coders Crush by Napplied AI - Built for engineers preparing for FAANG/MAANG interviews

Heap / Priority Queue

Dynamic Programming

Math & Geometry

Bit Manipulation

3 problems found

Subsets

MediumBacktracking

Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets....

O(n * 2^n) / O(n)

Permutations

MediumBacktracking

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order....

O(n! * n) / O(n)

N-Queens

HardBacktracking

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return al...