- Interview Questions
- /
- Nice
Nice LeetCode Interview Questions
Practice 37 real coding problems frequently asked in Nice technical interviews. Master these questions to ace your next Nice software engineering interview.
Top Topics at Nice
Ace your Nice interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Nice Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Kth Smallest Element in a BST 100% | MediumM | Solve→ |
Design Snake Game 80% | MediumM | Solve→ |
Valid Palindrome 80% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Tree 77% | MediumM | Solve→ |
Basic Calculator II 76% | MediumM | Solve→ |
Group Shifted Strings 76% | MediumM | Solve→ |
Number of Ships in a Rectangle 75% | HardH | Solve→ |
Merge k Sorted Lists 74% | HardH | Solve→ |
Convert Sorted List to Binary Search Tree 72% | MediumM | Solve→ |
Find Peak Element 71% | MediumM | Solve→ |
Logger Rate Limiter 70% | EasyE | Solve→ |
Minimum Difference in Sums After Removal of Elements 69% | HardH | Solve→ |
K-diff Pairs in an Array 68% | MediumM | Solve→ |
Open the Lock 68% | MediumM | Solve→ |
Rotate Image 68% | MediumM | Solve→ |
Minimum Path Sum 67% | MediumM | Solve→ |
Longest Increasing Subsequence 64% | MediumM | Solve→ |
Maximum Profit in Job Scheduling 63% | HardH | Solve→ |
Integer to Roman 60% | MediumM | Solve→ |
4Sum 60% | MediumM | Solve→ |
Merge Strings Alternately 57% | EasyE | Solve→ |
Longest Common Prefix 53% | EasyE | Solve→ |
Sum Root to Leaf Numbers 53% | MediumM | Solve→ |
Word Break 52% | MediumM | Solve→ |
Rotting Oranges 50% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Closest Binary Search Tree Value 49% | EasyE | Solve→ |
Best Time to Buy and Sell Stock 48% | EasyE | Solve→ |
Reveal Cards In Increasing Order 44% | MediumM | Solve→ |
Ransom Note 43% | EasyE | Solve→ |
Valid Number 41% | HardH | Solve→ |
Longest Arithmetic Subsequence of Given Difference 36% | MediumM | Solve→ |
Word Break II 34% | HardH | Solve→ |
First Missing Positive 32% | HardH | Solve→ |
Climbing Stairs 29% | EasyE | Solve→ |
Friends Of Appropriate Ages 26% | MediumM | Solve→ |
Koko Eating Bananas 25% | MediumM | Solve→ |
Implement Queue using Stacks 21% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Nice ask in interviews?
Nice commonly asks 37 coding problems in technical interviews, including Kth Smallest Element in a BST, Design Snake Game, Valid Palindrome. The difficulty breakdown is 9 Easy, 21 Medium, and 7 Hard problems.
How should I prepare for a Nice coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Nice interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Nice coding interviews?
Based on our data, Nice interviews include 9 Easy (24%), 21 Medium (57%), and 7 Hard (19%) problems.
Ready to ace your Nice interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required