Infor LeetCode Interview Questions
Practice 40 real coding problems frequently asked in Infor technical interviews. Master these questions to ace your next Infor software engineering interview.
Top Topics at Infor
Ace your Infor interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Infor Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Subsets II 100% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 97% | MediumM | Solve→ |
Copy List with Random Pointer 97% | MediumM | Solve→ |
Median of Two Sorted Arrays 95% | HardH | Solve→ |
K Inverse Pairs Array 93% | HardH | Solve→ |
The kth Factor of n 89% | MediumM | Solve→ |
Range Sum of BST 84% | EasyE | Solve→ |
Find Longest Self-Contained Substring 82% | HardH | Solve→ |
Recyclable and Low Fat Products 82% | EasyE | Solve→ |
Next Permutation 80% | MediumM | Solve→ |
Minimum Difference in Sums After Removal of Elements 76% | HardH | Solve→ |
Plus One 75% | EasyE | Solve→ |
Check if One String Swap Can Make Strings Equal 74% | EasyE | Solve→ |
Sliding Window Maximum 73% | HardH | Solve→ |
Two City Scheduling 72% | MediumM | Solve→ |
Subsets 72% | MediumM | Solve→ |
Search a 2D Matrix 72% | MediumM | Solve→ |
Rank Teams by Votes 71% | MediumM | Solve→ |
Valid Parentheses 70% | EasyE | Solve→ |
Add Two Integers 67% | EasyE | Solve→ |
Minimum Path Sum 67% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 66% | MediumM | Solve→ |
Subarrays with K Different Integers 63% | HardH | Solve→ |
Shortest Palindrome 53% | HardH | Solve→ |
Binary Tree Right Side View 51% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Pow(x, n) 51% | MediumM | Solve→ |
Palindrome Linked List 49% | EasyE | Solve→ |
Permutation in String 49% | MediumM | Solve→ |
Two Sum 49% | EasyE | Solve→ |
All Nodes Distance K in Binary Tree 44% | MediumM | Solve→ |
Find the Index of the First Occurrence in a String 40% | EasyE | Solve→ |
Remove All Adjacent Duplicates In String 39% | EasyE | Solve→ |
IP to CIDR 39% | MediumM | Solve→ |
Combination Sum 36% | MediumM | Solve→ |
Fraction to Recurring Decimal 32% | MediumM | Solve→ |
Coin Change II 26% | MediumM | Solve→ |
Gas Station 25% | MediumM | Solve→ |
Jump Game II 24% | MediumM | Solve→ |
Maximum Value at a Given Index in a Bounded Array 24% | MediumM | Solve→ |
Check If N and Its Double Exist 21% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Infor ask in interviews?
Infor commonly asks 40 coding problems in technical interviews, including Subsets II, Lowest Common Ancestor of a Binary Search Tree, Copy List with Random Pointer. The difficulty breakdown is 11 Easy, 22 Medium, and 7 Hard problems.
How should I prepare for a Infor coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Infor interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Infor coding interviews?
Based on our data, Infor interviews include 11 Easy (28%), 22 Medium (55%), and 7 Hard (18%) problems.
Ready to ace your Infor interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required