- Interview Questions
- /
- Informatica
Informatica LeetCode Interview Questions
Practice 38 real coding problems frequently asked in Informatica technical interviews. Master these questions to ace your next Informatica software engineering interview.
Top Topics at Informatica
Ace your Informatica interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Informatica Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Reorganize String 100% | MediumM | Solve→ |
Maximum Beauty of an Array After Applying Operation 94% | MediumM | Solve→ |
Evaluate Division 91% | MediumM | Solve→ |
Shortest Palindrome 86% | HardH | Solve→ |
Maximum Nesting Depth of the Parentheses 84% | EasyE | Solve→ |
Climbing Stairs 78% | EasyE | Solve→ |
Minimum Window Substring 76% | HardH | Solve→ |
Sliding Window Maximum 73% | HardH | Solve→ |
Merge Intervals 73% | MediumM | Solve→ |
Final Array State After K Multiplication Operations I 70% | EasyE | Solve→ |
High Five 70% | EasyE | Solve→ |
Flip Columns For Maximum Number of Equal Rows 69% | MediumM | Solve→ |
Coin Change 66% | MediumM | Solve→ |
Rotate Image 66% | MediumM | Solve→ |
Product of Array Except Self 65% | MediumM | Solve→ |
Minimum Add to Make Parentheses Valid 63% | MediumM | Solve→ |
Pascal's Triangle 63% | EasyE | Solve→ |
House Robber II 60% | MediumM | Solve→ |
Basic Calculator 60% | HardH | Solve→ |
Valid Anagram 56% | EasyE | Solve→ |
Largest Rectangle in Histogram 52% | HardH | Solve→ |
Implement Queue using Stacks 51% | EasyE | Solve→ |
Zero Array Transformation II 49% | MediumM | Solve→ |
Linked List Cycle 47% | EasyE | Solve→ |
Merge Strings Alternately 45% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Remove Duplicates from Sorted Array 45% | EasyE | Solve→ |
Find the Index of the First Occurrence in a String 44% | EasyE | Solve→ |
Making A Large Island 43% | HardH | Solve→ |
Goat Latin 42% | EasyE | Solve→ |
Find Score of an Array After Marking All Elements 41% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 39% | MediumM | Solve→ |
Closest Binary Search Tree Value 38% | EasyE | Solve→ |
Max Consecutive Ones III 35% | MediumM | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 34% | HardH | Solve→ |
Ransom Note 33% | EasyE | Solve→ |
Coin Change II 32% | MediumM | Solve→ |
Line Reflection 30% | MediumM | Solve→ |
N-Queens 29% | HardH | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Informatica ask in interviews?
Informatica commonly asks 38 coding problems in technical interviews, including Reorganize String, Maximum Beauty of an Array After Applying Operation, Evaluate Division. The difficulty breakdown is 14 Easy, 16 Medium, and 8 Hard problems.
How should I prepare for a Informatica coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Informatica interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Informatica coding interviews?
Based on our data, Informatica interviews include 14 Easy (37%), 16 Medium (42%), and 8 Hard (21%) problems.
Ready to ace your Informatica interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required