Sign In
Back to Sheets/Citadel Master DSA Sheet

Citadel Master DSA Sheet

This compilation contains exclusive, previously asked data structure and algorithm questions from real Citadel interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.

top-specificcitadel-prep
0
96
Course Schedule II6 Months
Medium
Word Ladder II
Hard
Design A Leaderboard3 Months
Medium
Meeting Rooms II
Medium
Find Servers That Handled Most Number of Requests
Hard
Number of Orders in the Backlog3 Months
Medium
Min Stack3 Months
Medium
Design Tic-Tac-Toe3 Months
Medium
Pow(x, n)
Medium
Trapping Rain Water
Hard
Climbing Stairs
Easy
Time Based Key-Value Store
Medium
Serialize and Deserialize Binary Tree
Hard
Next Permutation6 Months
Medium
Best Position for a Service Centre
Hard
Minimum Costs Using the Train Line
Hard
Longest Palindromic Substring
Medium
Merge Intervals
Medium
Koko Eating Bananas
Medium
Search Suggestions System
Medium
Longest String Chain
Medium
Optimal Account Balancing6 Months
Hard
Maximum Profit in Job Scheduling
Hard
Regular Expression Matching
Hard
Design Excel Sum Formula
Hard
Sqrt(x)
Easy
Parallel Courses III
Hard
Longest Non-decreasing Subarray From Two Arrays
Medium
Minimum Knight Moves
Medium
Insert Delete GetRandom O(1)
Medium
Design Circular Queue
Medium
Max Points on a Line
Hard
Combination Sum
Medium
Course Schedule
Medium
Reverse Words in a String
Medium
Maximum Total Damage With Spell Casting
Medium
Palindromic Substrings
Medium
Couples Holding Hands
Hard
LFU Cache
Hard
Permutations
Medium
Maximal Square
Medium
Word Ladder6 Months
Hard
Minimum Equal Sum of Two Arrays After Replacing Zeros
Medium
Number of Islands
Medium
Two Sum6 Months
Easy
LRU Cache6 Months
Medium
Maximum Subarray
Medium
Moving Average from Data Stream
Easy
Max Consecutive Ones III6 Months
Medium
Find the Duplicate Number
Medium
Simplify Path
Medium
Letter Combinations of a Phone Number
Medium
Design Front Middle Back Queue
Medium
Reconstruct Itinerary
Hard
Evaluate Division
Medium
Critical Connections in a Network
Hard
Word Search
Medium
Best Time to Buy and Sell Stock6 Months
Easy
Binary Tree Maximum Path Sum
Hard
Group Anagrams
Medium
Implement Trie (Prefix Tree)
Medium
Merge k Sorted Lists
Hard
Pairs of Songs With Total Durations Divisible by 60
Medium
Integer to Roman
Medium
Sudoku Solver
Hard
Reorganize String
Medium
Find Median from Data Stream3 Months
Hard
Sliding Window Maximum6 Months
Hard
Maximum Length of Repeated Subarray
Medium
Best Time to Buy and Sell Stock III
Hard
Delete and Earn
Medium
Validate Binary Search Tree6 Months
Medium
Longest Increasing Subsequence
Medium
Perfect Squares
Medium
Minimum Operations to Make Numbers Non-positive
Hard
Find First and Last Position of Element in Sorted Array
Medium
Binary Tree Zigzag Level Order Traversal
Medium
Length of Longest Subarray With at Most K Frequency
Medium
Best Time to Buy and Sell Stock IV
Hard
Fizz Buzz
Easy
Count Primes
Medium
Meeting Scheduler
Medium
Design Search Autocomplete System
Hard
Integer Break
Medium
Count Palindromic Subsequences
Hard
Paint House
Medium
Transform to Chessboard
Hard
Evaluate Reverse Polish Notation3 Months
Medium
Employee Free Time
Hard
Smallest Missing Non-negative Integer After Operations6 Months
Medium
Count Number of Maximum Bitwise-OR Subsets
Medium
Number of Dice Rolls With Target Sum
Medium
Egg Drop With 2 Eggs and N Floors
Medium
Rank Transform of a Matrix
Hard
Sort Items by Groups Respecting Dependencies
Hard
First Completely Painted Row or Column
Medium