Mahindra Comviva interview experience Real time questions & tips from candidates to crack your interview

Product Development Engineer

Mahindra Comviva

2 rounds | 4 Coding problems

Anonymous

Fresher | Nov 2021

Rejected

Interview preparation journey

Preparation

Duration: 4 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming.

Tip

Tip 1 : Practice daily question of DS algo
Tip 2 : Prepare all your projects
Tip 3 : Daily practice of aptitude
Tip 4 : Practice previous years Company questions:

Application process

Where: Campus

Eligibility: 6.5 CGPA

Resume tip

Tip 1 : Resume should contains only those skills that you know
Tip 2 : Add good projects and add github link to it also
Tip 3 : Resume should not be too long

Interview rounds

Round

Medium

Online Coding Interview

Duration150 minutes

Interview date26 Nov 2021

Coding problem2

The test consisted of 2 coding question and 25 questions of quantitative, reasoning and technical question based on DBMS, Data structrues

1. Sort An Array of 0s, 1s and 2s

Easy

10m average time

90% success

0/40

Asked in companies

You have been given an array/list 'arr' consisting of 'n' elements.

Each element in the array is either 0, 1 or 2.

Sort this array/list in increasing order.

Do not make a new array/list. Make changes in the given array/list.

Example :

Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]

Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]

Explanation: The array is sorted in increasing order.

Problem approach

Approach: The problem is similar to our old post “Segregate 0s and 1s in an array”.
The problem was posed with three colours, here `0′, `1′ and `2′. The array is divided into four sections:
a[1..Lo-1] zeroes (red)
a[Lo..Mid-1] ones (white)
a[Mid..Hi] unknown
a[Hi+1..N] twos (blue)
If the ith element is 0 then swap the element to the low range, thus shrinking the unknown range.
Similarly, if the element is 1 then keep it as it is but shrink the unknown range.
If the element is 2 then swap it with an element in high range.
Algorithm:
Keep three indices low = 1, mid = 1 and high = N and there are four ranges, 1 to low (the range containing 0), low to mid (the range containing 1), mid to high (the range containing unknown elements) and high to N (the range containing 2).
Traverse the array from start to end and mid is less than high. (Loop counter is i)
If the element is 0 then swap the element with the element at index low and update low = low + 1 and mid = mid + 1
If the element is 1 then update mid = mid + 1
If the element is 2 then swap the element with the element at index high and update high = high – 1 and update i = i – 1. As the swapped element is not processed
Print the array.

Try solving now

2. Middle Of Linked List

Easy

20m average time

80% success

0/40

Asked in companies

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.

Note:

1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.

Problem approach

Traverse linked list using two-pointers. Move one pointer by one and the other pointers by two. When the fast pointer reaches the end, the slow pointer will reach the middle of the linked list.

Try solving now

Round

Medium

Video Call

Duration30 minutes

Interview date3 Dec 2021

Coding problem2

Interviewer asked me questions about DS algo . and gave coding problems to solve

1. Kth Smallest Element

Easy

15m average time

85% success

0/40

Asked in companies

You are given an array of integers 'ARR' of size 'N' and another integer 'K'.

Your task is to find and return 'K'th smallest value present in the array.

Note: All the elements in the array are distinct.

Example

If 'N' is 5 and 'K' is 3 and the array is 7, 2, 6, 1, 9

Sorting the array we get 1, 2, 6, 7, 9

Hence the 3rd smallest number is 6.

Problem approach

A simple solution is to sort the given array using an O(N log N) sorting algorithm like Merge Sort, Heap Sort, etc, and return the element at index k-1 in the sorted array.
The Time Complexity of this solution is O(N log N)

Try solving now