i
Indiamart Intermesh
Filter interviews by
Clear (1)
Asked 2-3 coding problems and OOPS concept
MVC is a software design pattern that separates an application into three main components: Model, View, and Controller.
Model represents the data and business logic of the application
View is responsible for displaying the data to the user
Controller acts as an intermediary between Model and View, handling user input and updating the Model accordingly
MVC helps in achieving separation of concerns, making the code more orga
I applied via Campus Placement and was interviewed in Oct 2022. There were 3 interview rounds.
Easy DSA questions that can be solved easily.
I was interviewed before May 2023.
60 mins - aptitude test, then followed by mcq's and 2 coding questions for total 2 hrs in mettl platform
Indiamart Intermesh interview questions for designations
I applied via Referral and was interviewed before Apr 2022. There were 4 interview rounds.
Coding Questions which includes comcept of DataStructure and Algorithms
I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.
Top trending discussions
I was interviewed before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 6 interviews
Interview experience
based on 15 reviews
Rating in categories
Assistant Manager
2.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
891
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
674
salaries
| ₹0 L/yr - ₹0 L/yr |
Relationship Manager
656
salaries
| ₹0 L/yr - ₹0 L/yr |
Alibaba Group
TradeIndia (Infocom Network Private Limited)
Global Sources
ExportersIndia