Coders Crushby Napplied AI

Data Structures & Algorithms

100+ curated problems from top tech interviews

All Arrays & Hashing Two Pointers Sliding Window Stack & Queue Binary Search Linked Lists Trees Tries Heap / Priority Queue Graphs Dynamic Programming Backtracking Greedy Intervals Math & Geometry Bit Manipulation

9 problems found

Generate Parentheses

MediumBacktracking

Generate valid parentheses combinations...

O(4^n/√n) / O(n)

Word Search

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

MediumBacktracking

Search word in 2D grid...

O(m*n*4^L) / O(L)

Google, Amazon

Palindrome Partitioning

MediumBacktracking

Partition string into palindromes...

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

Google, Facebook

Subset Sum

MediumBacktracking

Check if subset sum exists...

Combinations

MediumBacktracking

Generate all k-combinations...

Letter Combinations Phone Number

MediumBacktracking

Letter combinations of phone number...

Permutations

MediumBacktracking

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

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)

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...