Mahindra Comviva Interview Experience

New update is available. Click here to update.

Product Development Engineer

Mahindra Comviva

2 rounds | 4 Coding problems

Anonymous

Fresher | Nov 2021

Rejected

580 views

0 comments

0 upvotes

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

Problems2

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

You have been given an array/list ARR consisting of ‘N’ elements. Each element in the array is either 0, 1 or 2.

Now, your task is to ...

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 ...

Try solving now

Middle Of Linked List

Given the head node of the singly linked list, return a pointer pointing to the middle of the linked list.

If there are an odd n...

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

Problems2

Kth Smallest Element

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.

...

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

Encode the Message