Coding questions
Mu Sigma Online Assessment
Overview
Detailed public write-ups on the Mu Sigma online test are still hard to find.
What public reports and campus notices usually say (still verify officially):
| Item | Working note |
|---|---|
| Online test name | Mu Sigma Online Assessment |
| Focus areas (metadata) | DSA, aptitude |
| Languages (metadata) | SQL, Python, R, Excel. |
| Reported round names | Online Assessment (puzzles/aptitude) → Technical/Case → HR. |
Practice drills
Coding Q1: Coin change (min coins)
Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.
Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.
Complexity: O(amount × coins)
Mu Sigma tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Binary search
Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.
Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.
Complexity: O(log n) time
Mu Sigma tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Move zeros
Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.
Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.
Complexity: O(n) time, O(1) space
Mu Sigma tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Rotate array
Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].
Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.
Complexity: O(n) time, O(1) space
Mu Sigma tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
What to do next
- Open the official careers page or your college placement email for Mu Sigma
- Search GeeksforGeeks + Reddit for
Mu Sigma interview experience - Use Faceprep / PrepInsta only if they match your placement email