Murex LeetCode Interview Questions
Practice 36 real coding problems frequently asked in Murex technical interviews. Master these questions to ace your next Murex software engineering interview.
Top Topics at Murex
Ace your Murex interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Murex Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Closest Binary Search Tree Value 100% | EasyE | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 90% | MediumM | Solve→ |
Shortest Path in Binary Matrix 87% | MediumM | Solve→ |
Subsets II 85% | MediumM | Solve→ |
Valid Palindrome II 80% | EasyE | Solve→ |
Number of Islands 80% | MediumM | Solve→ |
Alien Dictionary 75% | HardH | Solve→ |
Decode String 72% | MediumM | Solve→ |
Integer to English Words 71% | HardH | Solve→ |
Combination Sum 67% | MediumM | Solve→ |
Maximum Sum Circular Subarray 62% | MediumM | Solve→ |
Valid Palindrome III 59% | HardH | Solve→ |
Continuous Subarray Sum 55% | MediumM | Solve→ |
Reverse Words in a String 55% | MediumM | Solve→ |
First Unique Character in a String 54% | EasyE | Solve→ |
Rotting Oranges 54% | MediumM | Solve→ |
K-diff Pairs in an Array 47% | MediumM | Solve→ |
Jump Game II 47% | MediumM | Solve→ |
Rank Transform of a Matrix 45% | HardH | Solve→ |
Is Subsequence 44% | EasyE | Solve→ |
Identify the Largest Outlier in an Array 44% | MediumM | Solve→ |
Kth Smallest Element in a BST 40% | MediumM | Solve→ |
Diameter of Binary Tree 38% | EasyE | Solve→ |
Capacity To Ship Packages Within D Days 37% | MediumM | Solve→ |
Logger Rate Limiter 36% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Remove All Adjacent Duplicates in String II 34% | MediumM | Solve→ |
Flatten Binary Tree to Linked List 29% | MediumM | Solve→ |
The kth Factor of n 29% | MediumM | Solve→ |
Clone Graph 28% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 26% | MediumM | Solve→ |
Sliding Window Maximum 26% | HardH | Solve→ |
Minimum Add to Make Parentheses Valid 26% | MediumM | Solve→ |
Maximum Value at a Given Index in a Bounded Array 25% | MediumM | Solve→ |
Zero Array Transformation II 21% | MediumM | Solve→ |
Longest Increasing Path in a Matrix 21% | HardH | Solve→ |
Generate Parentheses 21% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Murex ask in interviews?
Murex commonly asks 36 coding problems in technical interviews, including Closest Binary Search Tree Value, Maximum Sum of Distinct Subarrays With Length K, Shortest Path in Binary Matrix. The difficulty breakdown is 6 Easy, 24 Medium, and 6 Hard problems.
How should I prepare for a Murex coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Murex interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Murex coding interviews?
Based on our data, Murex interviews include 6 Easy (17%), 24 Medium (67%), and 6 Hard (17%) problems.
Ready to ace your Murex interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required