Overview of topics
MCC OA is primarily Code-based.MCC Recently released OA in bulk, takes about 90 minutes to complete and contains three algorithmic questions:
- Array Reduction: Merge elements to a single value using minimum cost.
- Connected Groups: Count the number of interconnected groups in the social matrix.
- Build a Wall counts:: The number of wall construction options that satisfy the staggered joint condition for brick combinations with a width of 2 or 3.
Key ideas
- Array reductions: greedy + minimal heap-first merge of smallest elements.
- Connected groups: dfs/parallel set traversal of connected components.
- Build wall counting: dynamic planning generates all single layer seam layouts, then does seamless counting for multiple layers.
Code examples (Python)
import heapq
def reductionCost(nums).
heapq.heapify(nums)
cost = 0
cost = 0 while len(nums) > 1: while heapq.heapify(nums): heapq.
a = heapq.heappop(nums)
b = heapq.heappop(nums)
cost += a + b
heapq.heappush(nums, a + b)
return cost
Conclusion
Solve three questions in ten minutes or less. If you need OA tutoring or interview coaching services, pleaseContact us.
END
