Manappuram Comptech and Consultants Software Engineer Trainee Interview Questions and Answers

Q1. Public key Cryptography
Add your answer

Aptitude questions on data structures, database and some other technical questions

Coding on Data structures linked list and graph

I believe it was easy; they provided a total of 60 questions.

Two coding questions were provided: one was easy, and the other was hard.

Q1. Can you describe the coding scenario question you were given, and how it related to your resume?
Add your answer

Q1. Please explain the Quick Sort algorithm and its process of reallocation.
Ans. 
Quick Sort is a popular sorting algorithm that uses divide and conquer strategy to sort elements in an array.
• Quick Sort picks a pivot element and partitions the array around the pivot.

• It recursively sorts the sub-arrays on either side of the pivot.

• The process continues until the entire array is sorted.

• Example: Given array [5, 2, 9, 3, 7], after Quick Sort it becomes [2, 3, 5, 7, 9].
Answered by AI
Add your answer

General aptitude questions

Q1. Project discussion, detailed
Add your answer
Q2. Coding question on strings
Add your answer

Q1. Why this company, how do you handle conflict in team members. Which is your desired location, Pune or Hyderabad
Add your answer

1 Reverse a link list
2. Simple mathematical Problem

Q1. SQl, ML, AI Questions including java
Add your answer
Q2. SQL, ML, AI related questions including some core java questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

2 programming questions, MCQs based on OS, DBMS, OOPS and web fundamentals

Q1. Search In A 2D Matrix
You have been given a 2-D array 'MAT' of size M x N where 'M' and 'N' denote the number of rows and columns, respectively. The elements of each row are sorted ...read more
Ans. Brute Force
We have a brute force solution to this problem. We can simply traverse the matrix and check if ‘TARGET’ exists or not. 
Space Complexity: O(1)Explanation:
O(1)
 
Since, we are not using any extra space to find the number of pairs. Therefore, the overall space complexity will be O(1).
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(M*N) where ‘M’ and ‘N’ denote the number of rows and columns in ‘M...read more
Answered Anonymously
Add your answer
Q2. Reverse Linked List
You are given a Singly Linked List of integers. You need to reverse the Linked List by changing the links between nodes.
Input Format :
The first line of input contains a single integ...read more
Ans. Recursive Approach
One way is to use recursion to reverse the list. Divide the linked list in two halves, the first node and the rest of the list. Reverse the second half using recursion and append the first half, that is the first node at the end of the reversed linked list. Return the head of the reversed linked list.
 
Algorithm
 
• If the list contains only one node, return the head of the list.
• Else, divide the ...read more
Answered Anonymously
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

This round had 2 coding questions and some basic questions revolving around OOPs

Q1. Palindromic Linked List
You are given a singly Linked List of integers. Your task is to return true if the given singly linked list is a palindrome otherwise returns false.
For example:
The given linked ...read more
Ans. Using Stack
1. The idea is to traverse the Linked List from head to tail and push every encountered node data into the stack.
2. Then we traverse the Linked List and for each node, we pop the top element from the stack and compare it with current node data of the Linked List. If they mismatch then the current linked list is not palindrome else if all elements match then the linked list is a palindrome.
Space Complexity: O(n)Exp...read more
Answered Anonymously
Add your answer
Q2. Find the maximum level sum among all the levels in the Binary Tree
Given a Binary Tree with integer nodes, your task is to find the maximum level sum among all the levels in the Binary Tree. The sum of any...read more
Ans. Recursive Approach
Let’s traverse the given Binary tree using Recursion.The idea is to recursively store the sum of nodes of every level separately in a map.
 
• Take a map to store the sum of each level. 
• The recursive function has ‘ROOT’, current level, and map as its parameters.
  • Base Condition:  If ‘ROOT’ is NULL, return.
  • Add the value of the current node to the value mapped to the current level in the map.
  • Re...read more
Answered Anonymously
Add your answer
Q3. OOPS Question
How is an abstract class different from an interface?
Add your answer
Q4. OOPS Question
What is the difference between overloading and overriding?
Add your answer
Q5. OOPS Question
What is meant by static polymorphism?
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Was conducted a couple of hours after the previous Tech round. The round was a HR one, behavioral questions and discussion around my hobbies :)

Based on intermediate Data structures

Q1. Based on your resume
Add your answer

Q1. Check your communication level
Add your answer