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

Product Development Engineer

Mahindra Comviva
upvote
share-icon
2 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 15 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Practice at least 250 Questions
Tip 2 : Do at least 2 projects
Tip 3 : Practice Data Structures

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Have some projects on resume
Tip 2 : Do not put false things on resume

Interview rounds

01
Round
Medium
Online Coding Interview
Duration150 minutes
Interview date26 Nov 2021
Coding problem2

1. Word Break

Moderate
15m average time
85% success
0/80
Asked in companies
MicrosoftFacebookApple

You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.

Note :
You can use any string of A multiple times.
Examples :
A =[“coding”, ”ninjas”, “is”, “awesome”]  target = “codingninjas”
Ans = true as we use “coding” and “ninjas” to form “codingninjas”
Problem approach

The idea is simple, we consider each prefix and search it in dictionary. If the prefix is present in dictionary, we recur for rest of the string (or suffix).
If the recursive call for suffix returns true, we return true, otherwise we try next prefix. If we have tried all prefixes and none of them resulted in a solution, we return false.

Try solving now

2. Reverse List In K Groups

Hard
15m average time
85% success
0/120
Asked in companies
Paytm (One97 Communications Limited)SAP LabsSamsung

You are given a linked list of 'n' nodes and an integer 'k', where 'k' is less than or equal to 'n'.


Your task is to reverse the order of each group of 'k' consecutive nodes, if 'n' is not divisible by 'k', then the last group of nodes should remain unchanged.


For example, if the linked list is 1->2->3->4->5, and 'k' is 3, we have to reverse the first three elements, and leave the last two elements unchanged. Thus, the final linked list being 3->2->1->4->5.


Implement a function that performs this reversal, and returns the head of the modified linked list.


Example:
Input: 'list' = [1, 2, 3, 4], 'k' = 2

Output: 2 1 4 3

Explanation:
We have to reverse the given list 'k' at a time, which is 2 in this case. So we reverse the first 2 elements then the next 2 elements, giving us 2->1->4->3.


Note:
All the node values will be distinct.


Problem approach

Recursively traverse the linked list. When returning from each recursive call keep track of the node number, considering the last node as number 1, second last as number 2 and so on. This counting could be tracked with the help of a global or pointer variable. With the help of this count variable, print the nodes having a node number less than or equal to k.

Try solving now
02
Round
Medium
HR Round
Duration30 minutes
Interview date3 Dec 2021
Coding problem4

It was in the evening and online

1. Basic HR Question

Tell us about yourself.


 

2. Basic HR Question

What do you know about the company?


 

3. Basic HR Question

Where do you see yourself in 5 years?


 

4. Basic HR Question

Are there any questions you want to ask us?


 

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which collection class forbids duplicates?

Choose another skill to practice
Similar interview experiences
Product Development Engineer
4 rounds | 4 problems
Interviewed by Mahindra Comviva
981 views
1 comments
0 upvotes
Product Development Engineer
2 rounds | 4 problems
Interviewed by Mahindra Comviva
1173 views
0 comments
0 upvotes
Product Development Engineer
3 rounds | 5 problems
Interviewed by Mahindra Comviva
0 views
0 comments
0 upvotes
Product Development Engineer
2 rounds | 3 problems
Interviewed by Mahindra Comviva
0 views
0 comments
0 upvotes