Indiamart Intermesh Software Developer Intern Interview Questions and Answers

Graphs ,arrays , Hashmaps and Heaps

• Q1. Graphs related dfs
  Add Answer
• Q2. Changes on graph structure
  View Answers (1)

Round duration - 90 mintues
Round difficulty - Medium

Goes good no problem at all exam is between 10 to 11:30.

• Q1. Game of Dominoes Rafiq loves to play with dominoes. On his birthday his father gifted him ‘N’ piles of dominoes, where each pile contains a positive number of d...read more
  View Answers (3)
• Q2. Pair Sum You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements s...read more
  View Answers (3)

Round duration - 90 minutes
Round difficulty - Hard

Goes good no problem at all exam at same time between 10 to 11:30.

• Q1. Technical Question

  He started asking what problem i faced in my project and how i deal with it.

  Add Answer
• Q2. Ninja and Sorted Arrays Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists...read more
  View Answers (2)

Round duration - 30 minutes
Round difficulty - Easy

2 easy problems for coding.

• Q1. All Prime Numbers less than or equal to N You are given a positive integer 'N'. Your task is to return all the prime numbers less than or equal to the &...read more
  View Answers (4)
• Q2. Absolute difference in an array You are given an array/list 'ARR' consisting of 'N' non - negative integers. Your task is to return the running ...read more
  View Answers (2)

Round duration - 30 minutes
Round difficulty - Hard

Face to face interview, design and coding involved.

• Q1. DBMS Question

  Given a database of some records. Read records from there and using a formula, calculate maximum speed of cars.

  View Answers (1)

Round duration - 90 minutes
Round difficulty - Easy

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:30 PM.

• Q1. Meeting Ninja is organizing a meeting in an office that starts at a time ‘0’ and will end at a time ‘LAST’. There are ‘N’ presentations that are going to take p...read more
  View Answers (2)
• Q2. Total Unique Paths You are present at point ‘A’ which is the top-left cell of an M X N matrix, your destination is point ‘B’, which is the bottom-right cell of ...read more
  View Answers (4)

Round duration - 90 minutes
Round difficulty - Medium

This round was coding round with discussion .
The interviewer tried to trick the questions and wanted to test how we respond if something is asked out of preparation.
The code we ran on Google Docs was checked on Online IDE if it ran for sample inputs.
Timing : 12:00 PM to 1:30 PM

• Q1. Number of operations to make Graph connected You have been given a graph consisting of ‘N’ vertices numbered from 1 to ‘N’. The graph has ‘M’ edges. In an opera...read more
  View Answers (2)
• Q2. Snake and Ladder You have been given a Snake and Ladder Board with 'N' rows and 'N' columns with the numbers written from 1 to (N*N) starting fr...read more
  View Answers (1)

Round duration - 75 minutes
Round difficulty - Hard

This was a problem solving round and lasted for 75 minutes. The interviewer gave me a very complicated question.
The round was held on Google Meet and I was supposed to tell him the approach and write code on shared Google Docs.

• Q1. XOR Query Assume you initially have an empty array say ‘ARR’. You need to return the updated array provided that some ‘Q’ number of queries were performed on th...read more
  View Answers (3)