Nference LeetCode Interview Questions
Practice 35 real coding problems frequently asked in Nference technical interviews. Master these questions to ace your next Nference software engineering interview.
Top Topics at Nference
Ace your Nference interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Nference Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Maximum Area Rectangle With Point Constraints I 100% | MediumM | Solve→ |
Coin Change 98% | MediumM | Solve→ |
Design an Array Statistics Tracker 82% | HardH | Solve→ |
Two Sum II - Input Array Is Sorted 81% | MediumM | Solve→ |
Flatten Binary Tree to Linked List 81% | MediumM | Solve→ |
Kth Smallest Element in a Sorted Matrix 79% | MediumM | Solve→ |
Diameter of Binary Tree 72% | EasyE | Solve→ |
Is Subsequence 70% | EasyE | Solve→ |
Basic Calculator II 68% | MediumM | Solve→ |
Closest Binary Search Tree Value 67% | EasyE | Solve→ |
Valid Number 67% | HardH | Solve→ |
Word Break II 66% | HardH | Solve→ |
Asteroid Collision 61% | MediumM | Solve→ |
Gas Station 59% | MediumM | Solve→ |
Roman to Integer 59% | EasyE | Solve→ |
Unique Paths 56% | MediumM | Solve→ |
Longest Repeating Character Replacement 54% | MediumM | Solve→ |
Longest Increasing Subsequence 52% | MediumM | Solve→ |
Minimum Add to Make Parentheses Valid 52% | MediumM | Solve→ |
Boundary of Binary Tree 50% | MediumM | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 48% | EasyE | Solve→ |
Random Pick with Weight 44% | MediumM | Solve→ |
Unique Paths II 44% | MediumM | Solve→ |
Design Snake Game 44% | MediumM | Solve→ |
Missing Ranges 44% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Adding Spaces to a String 42% | MediumM | Solve→ |
Minimum Path Sum 40% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 35% | MediumM | Solve→ |
String Compression 35% | MediumM | Solve→ |
Word Ladder 33% | HardH | Solve→ |
Kth Smallest Element in a BST 30% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 28% | HardH | Solve→ |
Maximum Sum Circular Subarray 26% | MediumM | Solve→ |
Check Completeness of a Binary Tree 24% | MediumM | Solve→ |
Counting Bits 20% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Nference ask in interviews?
Nference commonly asks 35 coding problems in technical interviews, including Maximum Area Rectangle With Point Constraints I, Coin Change, Design an Array Statistics Tracker . The difficulty breakdown is 7 Easy, 23 Medium, and 5 Hard problems.
How should I prepare for a Nference coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Nference interviews typically emphasize Array and Dynamic Programming. Practice explaining your thought process while coding.
What is the difficulty level of Nference coding interviews?
Based on our data, Nference interviews include 7 Easy (20%), 23 Medium (66%), and 5 Hard (14%) problems.
Ready to ace your Nference interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required