Karat Interview Questions — 15 DSA Problems
15 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Karat LeetCode questions for software engineering interviews.
- Text Justification (HARD) — Array, String, Simulation
- Check if Every Row and Column Contains All Numbers (EASY) — Array, Hash Table, Matrix
- Find Words That Can Be Formed by Characters (EASY) — Array, Hash Table, String, Counting
- Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
- Alert Using Same Key-Card Three or More Times in a One Hour Period (MEDIUM) — Array, Hash Table, String, Sorting
- Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
- Ransom Note (EASY) — Hash Table, String, Counting
- Valid Sudoku (MEDIUM) — Array, Hash Table, Matrix
- Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
- Maximal Square (MEDIUM) — Array, Dynamic Programming, Matrix
- Subdomain Visit Count (MEDIUM) — Array, Hash Table, String, Counting
- Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix
- Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
- Jump Game (MEDIUM) — Array, Dynamic Programming, Greedy
- Two Sum (EASY) — Array, Hash Table
K
Karat
15 questions tracked15 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 15 of 15 questions
3ArrayHash TableStringCounting
4ArrayStringBacktrackingDepth-First Search+1
5MediumAlert Using Same Key-Card Three or More Times in a One Hour Period✓ Our Solution ArrayHash TableStringSorting
6Depth-First SearchBreadth-First SearchGraphTopological Sort
9ArrayDepth-First SearchBreadth-First SearchUnion Find+1
10ArrayDynamic ProgrammingMatrix
11ArrayHash TableStringCounting
12ArrayStringBacktrackingTrie+1
13Depth-First SearchBreadth-First SearchGraphTopological Sort
14ArrayDynamic ProgrammingGreedy