Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. Northrop Grumman

Northrop Grumman LeetCode Interview Questions

Practice 21 real coding problems frequently asked in Northrop Grumman technical interviews. Master these questions to ace your next Northrop Grumman software engineering interview.

5 Easy
13 Medium
3 Hard

Top Topics at Northrop Grumman

ArraySortingHash TableMathTree

Ace your Northrop Grumman interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Northrop Grumman Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Sqrt(x)
100%
EasyE
100%
MathBinary Search
Solve→
Kth Largest Element in an Array
85%
MediumM
85%
ArrayDivide and Conquer+3
Solve→
Binary Tree Zigzag Level Order Traversal
82%
MediumM
82%
TreeBreadth-First Search+1
Solve→
Top K Frequent Elements
80%
MediumM
80%
ArrayHash Table+6
Solve→
Making A Large Island
79%
HardH
79%
ArrayDepth-First Search+3
Solve→
Move Pieces to Obtain a String
75%
MediumM
75%
Two PointersString
Solve→
Counting Bits
73%
EasyE
73%
Dynamic ProgrammingBit Manipulation
Solve→
Merge Strings Alternately
72%
EasyE
72%
Two PointersString
Solve→
Continuous Subarray Sum
69%
MediumM
69%
ArrayHash Table+2
Solve→
Unique Paths II
63%
MediumM
63%
ArrayDynamic Programming+1
Solve→
Same Tree
58%
EasyE
58%
TreeDepth-First Search+2
Solve→
Friends Of Appropriate Ages
57%
MediumM
57%
ArrayTwo Pointers+2
Solve→
LFU Cache
52%
HardH
52%
Hash TableLinked List+2
Solve→
Find Leaves of Binary Tree
51%
MediumM
51%
TreeDepth-First Search+1
Solve→
Walls and Gates
50%
MediumM
50%
ArrayBreadth-First Search+1
Solve→
Two City Scheduling
49%
MediumM
49%
ArrayGreedy+1
Solve→
Minimum Area Rectangle
35%
MediumM
35%
ArrayHash Table+3
Solve→
Minimum Absolute Difference
33%
EasyE
33%
ArraySorting
Solve→
Binary Search Tree Iterator
33%
MediumM
33%
StackTree+4
Solve→
K-diff Pairs in an Array
29%
MediumM
29%
ArrayHash Table+3
Solve→
Insert Delete GetRandom O(1) - Duplicates allowed
27%
HardH
27%
ArrayHash Table+3
Solve→

Similar Companies

Explore interview questions from other companies with similar interview patterns.

Agoda
21 problems
Amadeus
21 problems
Applied Intuition
21 problems
Autodesk
21 problems
Bandcamp
21 problems
Clickup
21 problems

Frequently Asked Questions

What LeetCode problems does Northrop Grumman ask in interviews?

Northrop Grumman commonly asks 21 coding problems in technical interviews, including Sqrt(x), Kth Largest Element in an Array, Binary Tree Zigzag Level Order Traversal. The difficulty breakdown is 5 Easy, 13 Medium, and 3 Hard problems.

How should I prepare for a Northrop Grumman coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Northrop Grumman interviews typically emphasize Array and Sorting. Practice explaining your thought process while coding.

What is the difficulty level of Northrop Grumman coding interviews?

Based on our data, Northrop Grumman interviews include 5 Easy (24%), 13 Medium (62%), and 3 Hard (14%) problems.

Ready to ace your Northrop Grumman interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.