Booz Allen Hamilton LeetCode Interview Questions
Practice 35 real coding problems frequently asked in Booz Allen Hamilton technical interviews. Master these questions to ace your next Booz Allen Hamilton software engineering interview.
Top Topics at Booz Allen Hamilton
Ace your Booz Allen Hamilton interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Booz Allen Hamilton Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Add Two Numbers 100% | MediumM | Solve→ |
Analyze User Website Visit Pattern 87% | MediumM | Solve→ |
Number of Ships in a Rectangle 81% | HardH | Solve→ |
Palindrome Number 80% | EasyE | Solve→ |
Minimum Array Sum 79% | MediumM | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 76% | EasyE | Solve→ |
Longest Arithmetic Subsequence of Given Difference 74% | MediumM | Solve→ |
Group Shifted Strings 73% | MediumM | Solve→ |
Valid Word Abbreviation 71% | EasyE | Solve→ |
Best Time to Buy and Sell Stock 70% | EasyE | Solve→ |
Same Tree 68% | EasyE | Solve→ |
Find the Celebrity 63% | MediumM | Solve→ |
Linked List Cycle 61% | EasyE | Solve→ |
Minimum Limit of Balls in a Bag 60% | MediumM | Solve→ |
Diagonal Traverse 56% | MediumM | Solve→ |
Can Place Flowers 52% | EasyE | Solve→ |
Pascal's Triangle 52% | EasyE | Solve→ |
Find the Index of the First Occurrence in a String 50% | EasyE | Solve→ |
Dot Product of Two Sparse Vectors 45% | MediumM | Solve→ |
Open the Lock 44% | MediumM | Solve→ |
Maximum Beauty of an Array After Applying Operation 40% | MediumM | Solve→ |
Two City Scheduling 39% | MediumM | Solve→ |
K Closest Points to Origin 38% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 33% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 32% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Subsets 32% | MediumM | Solve→ |
Remove Letter To Equalize Frequency 31% | EasyE | Solve→ |
Expression Add Operators 29% | HardH | Solve→ |
Gas Station 27% | MediumM | Solve→ |
Merge Sorted Array 27% | EasyE | Solve→ |
Zero Array Transformation III 24% | MediumM | Solve→ |
Longest Palindromic Substring 23% | MediumM | Solve→ |
Longest Subarray of 1's After Deleting One Element 23% | MediumM | Solve→ |
Word Search 23% | MediumM | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 22% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Booz Allen Hamilton ask in interviews?
Booz Allen Hamilton commonly asks 35 coding problems in technical interviews, including Add Two Numbers, Analyze User Website Visit Pattern, Number of Ships in a Rectangle. The difficulty breakdown is 11 Easy, 22 Medium, and 2 Hard problems.
How should I prepare for a Booz Allen Hamilton coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Booz Allen Hamilton interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Booz Allen Hamilton coding interviews?
Based on our data, Booz Allen Hamilton interviews include 11 Easy (31%), 22 Medium (63%), and 2 Hard (6%) problems.
Ready to ace your Booz Allen Hamilton interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required