Fis LeetCode Interview Questions
Practice 35 real coding problems frequently asked in Fis technical interviews. Master these questions to ace your next Fis software engineering interview.
Top Topics at Fis
Ace your Fis interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Fis Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Same Tree 100% | EasyE | Solve→ |
Remove Duplicates from Sorted Array II 97% | MediumM | Solve→ |
Minimum Window Substring 90% | HardH | Solve→ |
Remove Duplicates from Sorted Array 86% | EasyE | Solve→ |
Coin Change 83% | MediumM | Solve→ |
Simplify Path 74% | MediumM | Solve→ |
Reverse Integer 69% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 67% | MediumM | Solve→ |
Squares of a Sorted Array 67% | EasyE | Solve→ |
Word Ladder II 67% | HardH | Solve→ |
Flatten Binary Tree to Linked List 65% | MediumM | Solve→ |
Check If N and Its Double Exist 63% | EasyE | Solve→ |
Integer to Roman 62% | MediumM | Solve→ |
Kth Largest Element in an Array 58% | MediumM | Solve→ |
Maximum Nesting Depth of the Parentheses 56% | EasyE | Solve→ |
Minimum Operations to Make Character Frequencies Equal 55% | HardH | Solve→ |
Maximum Number of Events That Can Be Attended 55% | MediumM | Solve→ |
Ways to Make a Fair Array 55% | MediumM | Solve→ |
Adding Spaces to a String 55% | MediumM | Solve→ |
Two Sum 54% | EasyE | Solve→ |
Boundary of Binary Tree 53% | MediumM | Solve→ |
Evaluate Division 52% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 49% | MediumM | Solve→ |
Shortest Path in Binary Matrix 46% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 43% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Valid Parentheses 42% | EasyE | Solve→ |
Zero Array Transformation III 38% | MediumM | Solve→ |
Recyclable and Low Fat Products 36% | EasyE | Solve→ |
Minimum Path Sum 34% | MediumM | Solve→ |
Continuous Subarrays 34% | MediumM | Solve→ |
Design an Array Statistics Tracker 33% | HardH | Solve→ |
K-diff Pairs in an Array 33% | MediumM | Solve→ |
Min Stack 31% | MediumM | Solve→ |
Implement Queue using Stacks 28% | EasyE | Solve→ |
Take Gifts From the Richest Pile 28% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Fis ask in interviews?
Fis commonly asks 35 coding problems in technical interviews, including Same Tree, Remove Duplicates from Sorted Array II, Minimum Window Substring. The difficulty breakdown is 10 Easy, 21 Medium, and 4 Hard problems.
How should I prepare for a Fis coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Fis interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Fis coding interviews?
Based on our data, Fis interviews include 10 Easy (29%), 21 Medium (60%), and 4 Hard (11%) problems.
Ready to ace your Fis interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required