Multicoreware OA - On campus for software developer and Research Engineer role.
Summary
I completed a two‑round online assessment for a software engineer position at Multicoreware, which included an objective MCQ round and a subjective coding round with three DSA problems.
Full Experience
The OA divided into two rounds Objective round and Subjective round.
Round 1 - Objective
These round consists of 25 mcq and each carry some negative marks. The question comprises of
i)Basic concepts in c++ such as constructor,new keyword ,Some questions from python those are output prediction and 3-4 from basic aptitude.
==============================================
Round 2 - Subjective
Those who are all cleared round 1 eligible for round 2.
This round comprises of 3 DSA coding questions.
1.) Second largest element from array .The array contains duplicate element but we need to make sure the second largest pick from distinct element - Easy.
2.)Transpose a matrix in place- Easy.
3.)Coin change problem where we give infinite supply of given denominations we should return the minimum number of coins required for the given amount- Medium.
The test takes place in platform "Equip".
Both rounds happened within a single day.
The above process is for software engineer role.
Interview Questions (3)
Second Largest Distinct Element in Array
Given an array that may contain duplicate values, find the second largest element considering only distinct values. For example, in the array [5, 3, 5, 2], the largest distinct element is 5 and the second largest distinct element is 3.
In‑Place Matrix Transposition
Given a square matrix, transpose it in place without using extra space for another matrix. The transposition should swap rows and columns such that element at position (i, j) becomes element at position (j, i).
Coin Change – Minimum Coins (Infinite Supply)
Given an unlimited supply of coins of specified denominations, determine the minimum number of coins required to make up a given amount. If the amount cannot be formed, indicate that it is impossible.