Capital One Interview Questions — 47 DSA Problems 44 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Capital One LeetCode questions for software engineering interviews.
Simple Bank System (MEDIUM) — Array, Hash Table, Design, Simulation Spiral Matrix (MEDIUM) — Array, Matrix, Simulation Block Placement Queries (HARD) — Array, Binary Search, Binary Indexed Tree, Segment Tree Text Justification (HARD) — Array, String, Simulation Minimum Operations to Write the Letter Y on a Grid (MEDIUM) — Array, Hash Table, Matrix, Counting Candy Crush (MEDIUM) — Array, Two Pointers, Matrix, Simulation Count Alternating Subarrays (MEDIUM) — Array, Math Rotate Image (MEDIUM) — Array, Math, Matrix Four Divisors (MEDIUM) — Array, Math Simplify Path (MEDIUM) — String, Stack Count Operations to Obtain Zero (EASY) — Math, Simulation Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit (MEDIUM) — Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue Split Message Based on Limit (HARD) — String, Binary Search, Enumeration Rotating the Box (MEDIUM) — Array, Two Pointers, Matrix Number of Black Blocks (MEDIUM) — Array, Hash Table, Enumeration Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming Number of Flowers in Full Bloom (HARD) — Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set Find the Length of the Longest Common Prefix (MEDIUM) — Array, Hash Table, String, Trie Count Prefix and Suffix Pairs II (HARD) — Array, String, Trie, Rolling Hash, String Matching, Hash Function Remove Boxes (HARD) — Array, Dynamic Programming, Memoization Largest Rectangle in Histogram (HARD) — Array, Stack, Monotonic Stack Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search Design File System (MEDIUM) — Hash Table, String, Design, Trie Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix Number of Subarrays That Match a Pattern I (MEDIUM) — Array, Rolling Hash, String Matching, Hash Function Palindrome Number (EASY) — Math Add Strings (EASY) — Math, String, Simulation Merge Intervals (MEDIUM) — Array, Sorting Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix Add Two Numbers (MEDIUM) — Linked List, Math, Recursion Binary Tree Paths (EASY) — String, Backtracking, Tree, Depth-First Search, Binary Tree Non-overlapping Intervals (MEDIUM) — Array, Dynamic Programming, Greedy, Sorting Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum Rotate Array (MEDIUM) — Array, Math, Two Pointers Minimum Absolute Difference Between Elements With Constraint (MEDIUM) — Array, Binary Search, Ordered Set Reverse Nodes in k-Group (HARD) — Linked List, Recursion K-diff Pairs in an Array (MEDIUM) — Array, Hash Table, Two Pointers, Binary Search, Sorting Number of Adjacent Elements With the Same Color (MEDIUM) — Array Best Time to Buy and Sell Stock II (MEDIUM) — Array, Dynamic Programming, Greedy Count Prefix and Suffix Pairs I (EASY) — Array, String, Trie, Rolling Hash, String Matching, Hash Function Valid Parentheses (EASY) — String, Stack Merge Two Sorted Lists (EASY) — Linked List, Recursion Get Biggest Three Rhombus Sums in a Grid (MEDIUM) — Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sum Roman to Integer (EASY) — Hash Table, Math, String Find Servers That Handled Most Number of Requests (HARD) — Array, Greedy, Heap (Priority Queue), Ordered Set LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List CO
Capital One 47 questions tracked 44 with solutions
📊 All Time 47 📅 Last 6 Months 21 🔥 Last 3 Months 15 ⚡ Last 30 Days 5
Frequency scoreSorted highest → lowest frequency ✓ Our Solution = we have a detailed walkthrough
Showing 47 of 47 questions
1 Array Hash Table Design Simulation
3 Array Binary Search Binary Indexed Tree Segment Tree
5 Medium Minimum Operations to Write the Letter Y on a Grid ✓ Our Solution Array Hash Table Matrix Counting
6 Medium Candy Crush
Array Two Pointers Matrix Simulation
12 Medium Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit ✓ Our Solution Array Queue Sliding Window Heap (Priority Queue) +2
13 String Binary Search Enumeration
15 Array Hash Table Enumeration
17 Array Hash Table Binary Search Sorting +2
18 Array Hash Table String Trie
19 Array String Trie Rolling Hash +2
20 Array Dynamic Programming Memoization
21 Array Stack Monotonic Stack
22 Array Dynamic Programming Breadth-First Search
23 Medium Design File System
Hash Table String Design Trie
24 Array String Backtracking Depth-First Search +1
25 Array Rolling Hash String Matching Hash Function
29 Array Depth-First Search Breadth-First Search Union Find +1
31 String Backtracking Tree Depth-First Search +1
32 Array Dynamic Programming Greedy Sorting
33 Array String Backtracking Trie +1
34 Medium Meeting Rooms II
Array Two Pointers Greedy Sorting +2
36 Medium Minimum Absolute Difference Between Elements With Constraint ✓ Our Solution Array Binary Search Ordered Set
38 Array Hash Table Two Pointers Binary Search +1
40 Array Dynamic Programming Greedy
41 Array String Trie Rolling Hash +2
44 Array Math Sorting Heap (Priority Queue) +2
46 Array Greedy Heap (Priority Queue) Ordered Set
47 Hash Table Linked List Design Doubly-Linked List