Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Mahindra Comviva interview experience Real time questions & tips from candidates to crack your interview
Product Development Engineer
Mahindra Comviva
upvote
share-icon
2 rounds | 4 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming.
Tip
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
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
01
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
IBMSamsungDirecti

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


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


S...

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

View more
Try solving now
2. Middle Of Linked List
Easy
20m average time
80% success
0/40
Asked in companies
SamsungInfosysCognizant

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

View more
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
02
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
SnapdealMicrosoftMedia.net

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


Your task is to find and return 'K&#...

View more
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
2. Encode the Message
Easy
18m average time
90% success
0/40
Asked in companies
Expedia GroupMorgan StanleyCognizant

You have been given a text message. You have to return the Run-length Encoding of the given message.

View more
Try solving now
Start a Discussion
Similar interview experiences
company logo
Product Development Engineer
4 rounds | 4 problems
Interviewed by Mahindra Comviva
743 views
1 comments
0 upvotes
company logo
Product Development Engineer
3 rounds | 5 problems
Interviewed by Mahindra Comviva
0 views
0 comments
0 upvotes
company logo
Product Development Engineer
2 rounds | 6 problems
Interviewed by Mahindra Comviva
0 views
0 comments
0 upvotes
company logo
Product Development Engineer
2 rounds | 3 problems
Interviewed by Mahindra Comviva
0 views
0 comments
0 upvotes