Lockheed Martin LeetCode Interview Questions
Practice 33 real coding problems frequently asked in Lockheed Martin technical interviews. Master these questions to ace your next Lockheed Martin software engineering interview.
Top Topics at Lockheed Martin
Ace your Lockheed Martin interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Lockheed Martin Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Median of Two Sorted Arrays 100% | HardH | Solve→ |
Container With Most Water 99% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 86% | HardH | Solve→ |
Spiral Matrix 82% | MediumM | Solve→ |
Minimum Difference in Sums After Removal of Elements 82% | HardH | Solve→ |
Lowest Common Ancestor of a Binary Tree III 80% | MediumM | Solve→ |
Number of Islands 79% | MediumM | Solve→ |
Number of Ships in a Rectangle 75% | HardH | Solve→ |
Remove All Adjacent Duplicates In String 74% | EasyE | Solve→ |
The kth Factor of n 69% | MediumM | Solve→ |
Ways to Make a Fair Array 64% | MediumM | Solve→ |
Find Leaves of Binary Tree 64% | MediumM | Solve→ |
Add Two Integers 62% | EasyE | Solve→ |
Minimum Window Substring 62% | HardH | Solve→ |
Minimum Array Sum 61% | MediumM | Solve→ |
Task Scheduler 57% | MediumM | Solve→ |
Add Two Numbers 56% | MediumM | Solve→ |
Maximum Area Rectangle With Point Constraints I 51% | MediumM | Solve→ |
Kth Missing Positive Number 49% | EasyE | Solve→ |
Remove All Occurrences of a Substring 47% | MediumM | Solve→ |
Design an Array Statistics Tracker 40% | HardH | Solve→ |
Fraction to Recurring Decimal 38% | MediumM | Solve→ |
Find K Pairs with Smallest Sums 37% | MediumM | Solve→ |
Largest Number 33% | MediumM | Solve→ |
String Compression 32% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Construct String With Repeat Limit 29% | MediumM | Solve→ |
Design HashMap 29% | EasyE | Solve→ |
Line Reflection 28% | MediumM | Solve→ |
Integer to Roman 25% | MediumM | Solve→ |
Buildings With an Ocean View 25% | MediumM | Solve→ |
Reverse Linked List 24% | EasyE | Solve→ |
Product of Array Except Self 22% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node 20% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Lockheed Martin ask in interviews?
Lockheed Martin commonly asks 33 coding problems in technical interviews, including Median of Two Sorted Arrays, Container With Most Water, Binary Tree Maximum Path Sum. The difficulty breakdown is 5 Easy, 22 Medium, and 6 Hard problems.
How should I prepare for a Lockheed Martin coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Lockheed Martin interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Lockheed Martin coding interviews?
Based on our data, Lockheed Martin interviews include 5 Easy (15%), 22 Medium (67%), and 6 Hard (18%) problems.
Ready to ace your Lockheed Martin interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required