Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Indiamart Intermesh Team. If you also belong to the team, you can get access from here

Indiamart Intermesh Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Indiamart Intermesh Software Engineer Interview Questions and Answers

Updated 28 Aug 2024

Indiamart Intermesh Software Engineer Interview Experiences

4 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Nice interview experience with easy questions

Round 2 - HR 

(2 Questions)

  • Q1. What are your projects
  • Q2. What is the experience in tech
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

Basics questions were asked

Round 3 - Coding Test 

Questions about python and java

Round 4 - Group Discussion 

They were given a topic about the students preferring studying in foreign countries than India

Round 5 - HR 

(2 Questions)

  • Q1. This was my final round and this was not so difficult than i expected
  • Q2. Tell me about one thing that's not in your resume

Interview Preparation Tips

Interview preparation tips for other job seekers - never give up

Software Engineer Interview Questions Asked at Other Companies

asked in Qualcomm
Q1. Bridge and torch problem : Four people come to a river in the nig ... read more
asked in Capgemini
Q2. In a dark room,there is a box of 18 white and 5 black gloves. You ... read more
asked in TCS
Q3. Find the Duplicate Number Problem Statement Given an integer arra ... read more
Q4. Tell me something about yourself. Define encapsulation. What is i ... read more
asked in Paytm
Q5. Puzzle : 100 people are standing in a circle .each one is allowed ... read more

I was interviewed in Dec 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round was easy for me because this round only has Basic Math, OS, Programming and English Grammar questions.
There were also two easy coding problems.

  • Q1. 

    Prime Numbers within a Range

    Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.

    Input:

    Integer N

    Output:

    Prime numbers printed on separate lines

    Example:

    Input...
  • Ans. 

    Generate and print all prime numbers between 2 and N, inclusive.

    • Iterate from 2 to N and check if each number is prime

    • Use a helper function to determine if a number is prime

    • Print each prime number on a new line

  • Answered by AI
  • Q2. 

    Form a Triangle Problem Statement

    You are given an array of integers ARR with a length of N. Your task is to determine whether it's possible to construct at least one non-degenerate triangle using the val...

  • Ans. 

    Check if it's possible to form a non-degenerate triangle using the given array elements as sides.

    • Iterate through each test case and check if the sum of any two sides is greater than the third side to form a triangle.

    • If the above condition is met for any combination of sides, return 'YES'; otherwise, return 'NO'.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

This was interview round where one indiamart senior lead engineer was interviewer. Initially I was nervous but interviewer was very gentle so I was very comfortable at the middle of interview. Interview was based on my resume and some basic problem solving questions.

  • Q1. 

    Remove Character from String Task

    Given a string str and a character X, your task is to create a function that removes all occurrences of X from the given string.

    If the character X is not found in the s...

  • Ans. 

    Create a function to remove all occurrences of a given character from a string.

    • Iterate through the string and build a new string excluding the specified character.

    • Use string manipulation functions to remove the character efficiently.

    • Handle the case where the character is not found in the string.

    • Return the updated string after removing all occurrences of the character.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from NATIONAL INSTITUTE OF TECHONOLGY, Hamirpur. I applied for the job as Software Engineer in NoidaEligibility criteriaAbove 6 CGPAIndiaMart interview preparation:Topics to prepare for the interview - Data structures, Algorithms, OOPS , Operating systems, DBMS, SQL , NoSQL, Backend Development conceptsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Practice At least 100 easy and 200 medium DS & Algorithms based questions.
Tip 2 : Make 2 to 3 good projects based on any technology you like and show them on your portfolio website or resume.
Tip 3 : Contribute to open source projects. At least make a pull request if you are able to solve the bug.

Application resume tips for other job seekers

Tip 1 : Your resume must be simple and easy to read.
Tip 2 : You should add all your experiences which you have achieved in your career.
Tip 3 : Only add 2 top projects which you like.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Apr 2023.

Round 1 - Coding Test 

Coding+ apti + quant

Round 2 - Technical 

(1 Question)

  • Q1. Interview: DSA and OS

Indiamart Intermesh interview questions for designations

 Associate Software Engineer

 (5)

 Software Engineer Trainee

 (2)

 Software Developer

 (7)

 Software Programmer

 (1)

 Software Trainee

 (1)

 QA Engineer

 (3)

 Devops Engineer

 (1)

 System Engineer

 (1)

Interview questions from similar companies

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

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.

  • Q1. 

    Binary Tree Traversals Problem Statement

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

  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    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

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

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

  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    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

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    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.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    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.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Coding questions were comparatively easy. There were three questions.1. Given a string map each character of which to the corresponding digit in a 10 digit mobile phone keypad.2. Don't remember, will add when it comes to my mind.3. Don't remember, will add when it comes to my mind.

Skills: Coding ability, Complete knowledge of working of internet.,
College Name: IIT Bombay

Interview Preparation Tips

Round: Test
Experience: Just 1 online test



Round - I (90 mins)



Online Test conducted @ HackerRank



a. M.C.Qs (Operating System + Aptitude + C Programming Language + Object Oriented Programming)



b. Programming (2 coding questions)The Online Exam started off after a brief Presentation on Amazon.





The MCQs were largely based on Operating System, Data structures and Algorithms, OOP concepts, C language and Aptitude.



Coding Questions



1. Determine whether a Linked List is a palindrome or not.



2. Given few sets of intervals print out the the entire intervals without overlapping , if they overlap then combine them into one.



Eg: Input : (5,7) (1 , 6) (2 ,4) (10 ,14) (8,9)



Output : (1,7) (8,9) (10,14)



Advice: Must solve at least 1 coding question to have a good chance for selection into the next round
Tips: CGPA holds importance because it is basic eligibility criteria for written test and then secondly it increases odds in your favor of your selection more than those with lower CGPA with same interview performance. Prepare a good resume



1. Prioritize your content



2. Put the most important information first (Academic Projects + Internship)



3. Proofread it twice



Advice : Do your best and leave the rest to god

Round: Test
Experience: Round II

2 Coding questions

1. Classic 2-sum problem

2. Given numbers a, b as the seeds for the Fibonacci sequence determine if a third number 'k' is a part of that sequence or not. (Tricky)
Total Questions: 2

Round: Other Interview
Experience: Round III
1. Tell me about yourself
2. Project + Internship Discussion
3. Compress a given string "aabbbccc" to "a2b3c3"
constraint: inplace compression, no extra space to be used
assumption : output size will not exceed input size

Round: Technical Interview
Experience: Round IV
1. Internship Project Discussion (30 mins)
2. Find the largest count of 0s in a row in a matrix of 0s and 1s sorted in an ascending order row-wise.
3. Replicate a tree with random pointers inplace

Round: Other Interview
Experience: Round V
1. Question related to graphs involving concepts of Depth and Height of a tree. (Took a lot of time in solving it ! but finally recognized the pattern)
2. Maximum size square sub-matrix with all 1s
3. Find the median of an infinite series of integers
4. Find the most popular Google searches. (solved it using Trie and Max-Heaps)
2 more questions but can't remember them.Finally after waiting for more than 9 hours the results were announced and I was selected
Tips: Be cool and always ask the interviewer questions at the end of the interview. Explain the interviewer your progress while solving the question so that you both are on the same page + its easier for him to understand. Behavioral and H.R.
Tips
1. Speak clearly and with confidence
2. Always prepare yourself beforehand for some common questions like:
a. Tell me about yourself.
b. Why should I hire you?
c. What are your strengths and weaknesses? (give examples)
d. What is your Dream Company?

General Tips: They judge you purely on the basis of your knowledge and performance during the face to face interviews. The extra curricular activities are not given much consideration as Amazon focuses its recruitment procedure purely on the basis of your Technical Knowledge. Prepare a good resume
1. Prioritize your content
2. Put the most important information first (Academic Projects + Internship)
3. Proofread it twice
College Name: NIT JAIPUR

Interview Questionnaire 

8 Questions

  • Q1. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity
  • Ans. 

    The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.

    • Traverse the n-ary tree using a depth-first search (DFS) algorithm

    • Keep track of the count of 'B' occurrences

    • When the count reaches 3, return the current position

    • If the end of the tree is reached before the 3rd 'B', return -1

  • Answered by AI
  • Q2. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary
  • Ans. 

    Check if a given string is a composite of two words from a limited dictionary.

    • Create a hash set of all the words in the dictionary.

    • Iterate through all possible pairs of substrings in the given string.

    • Check if both substrings are present in the hash set.

    • If yes, return true. Else, return false.

  • Answered by AI
  • Q3. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3
  • Ans. 

    Switch adjacent nodes in a single linked list.

    • Traverse the linked list and swap adjacent nodes.

    • Keep track of previous node to update its next pointer.

    • Handle edge cases for first two nodes and last node.

    • Example: 1->2->3->4 becomes 2->1->4->3.

  • Answered by AI
  • Q4. Given a binary search tree. Traverse only the left sub-tree
  • Ans. 

    Traverse only the left sub-tree of a binary search tree.

    • Start at the root node

    • If the left child exists, visit it and repeat the process

    • If the left child does not exist, return to the parent node

    • Continue until all nodes in the left sub-tree have been visited

  • Answered by AI
  • Q5. Implementation of AVL tree. I told solution in nlogn. He asked me optimize further
  • Q6. Write a program to test whether a string and all strings that can be made using the characters of that string are palindrome or not Input Output mmo True yakak True travel False
  • Q7. Next, I was asked to design an efficient data structure for two lifts in a building of n floors
  • Ans. 

    Design an efficient data structure for two lifts in a building of n floors.

    • Use a priority queue to keep track of the floors each lift is heading to

    • Implement a scheduling algorithm to determine which lift to assign to a new request

    • Consider adding a weight limit to each lift to prevent overloading

    • Use a hash table to keep track of the current location of each lift

  • Answered by AI
  • Q8. Given a Integer, find the maximum number that can be formed from the digits. Input : 8754365 output : 8765543
  • Ans. 

    To find the maximum number that can be formed from the digits of an integer.

    • Convert the integer to a string

    • Sort the characters in descending order

    • Join the sorted characters to form the maximum number

  • Answered by AI

Interview Preparation Tips

Skill Tips: They were looking for really cool coders. High expectation on accurate answers. looking for deep understanding of algorithms and data structures.
Skills: Algorithms, Data structures
College Name: PSIT

Skills evaluated in this interview

Interview Questionnaire 

11 Questions

  • Q1. A String was given with a lot of words in it and I had to reverse all the words
  • Ans. 

    Reverse all the words in a given string

    • Split the string into an array of words

    • Loop through the array and reverse each word

    • Join the reversed words back into a string

  • Answered by AI
  • Q2. A String was given and I have to swap word by word from the beginning to the end
  • Q3. In question 2 when there are ‘n’ in the String whose position shouldn’t get affected during the swapping process
  • Ans. 

    Explaining how to handle 'n' in a string during swapping process

    • Identify the positions of 'n' in the string

    • Exclude those positions from the swapping process

    • Use a temporary variable to swap the characters

    • Ensure the swapped characters are not 'n'

    • Return the modified string

  • Answered by AI
  • Q4. Continuation was when more than 1 ‘n’ occur together
  • Q5. There is a big file containing numbers and we have to sort all of them
  • Ans. 

    We can use any sorting algorithm like quicksort, mergesort, heapsort, etc.

    • Choose the appropriate sorting algorithm based on the size of the file and the range of numbers

    • Implement the chosen algorithm in the programming language of choice

    • Read the numbers from the file into an array or list

    • Apply the sorting algorithm to the array or list

    • Write the sorted numbers back to the file

  • Answered by AI
  • Q6. How to implement word suggestions like that in Eclipse
  • Ans. 

    Word suggestions in Eclipse can be implemented using algorithms like Trie or N-gram models.

    • Use Trie data structure to store the dictionary of words

    • Implement auto-complete feature using Trie

    • Use N-gram models to suggest words based on context

    • Train the N-gram model on a large corpus of text data

    • Combine both approaches for better accuracy

    • Consider user's typing speed and frequency of words for better suggestions

  • Answered by AI
  • Q7. Given 2 integers a and b, the sequence which will be formed is a, b, a+b, a+2b…. i.e Current element = sum of the previous 2 elements. So now given a number k, how to figure out if it lies in the sequenc...
  • Ans. 

    To check if a number k lies in a sequence formed by adding previous 2 elements, start with a=0 and b=1 and iterate until k is found or exceeded.

    • Start with a=0 and b=1

    • Iterate through the sequence until k is found or exceeded

    • If k is found, return true. If exceeded, return false

  • Answered by AI
  • Q8. Given a Binary Tree, if it is a BST or not
  • Ans. 

    Check if a Binary Tree is a Binary Search Tree (BST)

    • A BST has the property that all nodes in the left subtree of a node have values less than the node's value, and all nodes in the right subtree have values greater than the node's value

    • We can traverse the tree in-order and check if the resulting sequence is sorted

    • Alternatively, we can recursively check if each node satisfies the BST property

  • Answered by AI
  • Q9. A stream of numbers are coming and I have to keep track of the kth largest number in it
  • Ans. 

    Keep track of kth largest number in a stream of numbers.

    • Use a min-heap of size k to keep track of kth largest number.

    • For each incoming number, compare it with the root of the heap.

    • If it is larger than the root, replace the root with the new number and heapify.

    • The root of the heap will always be the kth largest number.

  • Answered by AI
  • Q10. Summer Internship Project
  • Q11. Given an Infix expression, how to evaluate its answer
  • Ans. 

    Infix expression can be evaluated using the concept of operator precedence and associativity.

    • Convert the infix expression to postfix expression using stack data structure

    • Evaluate the postfix expression using stack data structure

    • Use operator precedence and associativity rules to determine the order of evaluation

    • Parentheses can be used to override the default order of evaluation

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 1 Written Test - (20 MCQ + 2 Coding Questions) on HackerRankAmazon visited our Campus on 28th July. In the morning the recruitment process started with the Written Test. It was taken on Hacker Rank which comprised of 20 MCQ Questions followed by 2 Programming Questions. MCQ Questions usually contain questions on C, DBMS, OS, and 4-5 Logical Questions. One should be aware that the Hacker Rank platform keeps record of how much time you have spent on each Question and after spending so much time did you attempt it or not. The 2 Coding Problems were quite easy. Only speed and accuracy was required to crack this round.Written Round Coding Question -1) A Linked List was given and we had to swap the ith node with (n-i+1)th node.2)(given some intervals), merge the common Intervals.I coded both the problems and passed all the test cases of the first question and half of the test cases of the 2nd Question. By the evening the results of the written round were declared and the Interview Process started. I rushed to the Design Centre and while I was arranging my grade sheets and my resume , something totally unexpected happened. One of the Amazon Employees who was also an Alumni of MNIT Jaipur walked up to me and told me that I have done very well in the Written Test and I was ranked 2nd based on the Written Test. He wished me ‘Best of Luck’ and told me to calm down and give my best. Talking to him really motivated me a lot. At the same time I was shocked that he still remembered my name even after an year, as we had talked only for a couple of minutes during my Internship Process in Amazon in which I was among the last 3 Students who went to the final round but was not selected. Apart from the students shortlisted from the written test, Amazon also shortlists around 5-6 more candidates based on their CGPA and some other factors. But it should be noted that at any time during the Recruitment Process, Cumulative scores can be considered.
Tips: CGPA above 8 should definitely be maintained.
Total Questions: 22

Round: Technical Interview
Experience: The Interview Process started with around 25 candidates. I was among the first few with whom the Interview had started which went on smoothly



Questions of Interview Round II –



1) A String was given with a lot of words in it and I had to reverse all the words
2) A String was given and I have to swap word by word from the  beginning to the end.
3) In question 2 when there are ‘n’ in the String whose position shouldn’t get affected during the swapping process
4) Continuation was when more than 1 ‘n’ occur together.



I was asked to code the above, and told them about the time and space complexities. Then he went through my resume and based on my projects he appreciated my interest in OS. and asked me a Question –


You have a large game and a small memory, so how will you play the game.
I told him the concept of Virtual Memory and how it makes it possible to run such a game. Then he asked me whether there is any limit or constraint on the size of the virtual memory. I explained to him if the amount of memory required at any particular moment of time to run the game, itself exceeds the available size in the RAM for the user, then we won’t be able to play. Then he asked “Suppose you have a 4 GB Ram then how much memory will be available to the user and what will happen to the other memory”. I explained that kernel occupies some memory and apart from that page tables and all are also stored in the memory. Then there were some discussions regarding my projects.
Tips: These is some Important stuff which one should not miss while preparing for the interviews :


Languages one should be knowing for Placements:
1) C : For most of the companies
2) C ++ - For Faster coding using Standard Template Libraries and for OOPS Concept3) Java – For some specific companies which are focused on Java


Operating System:
1) Galvin Text Book
2) Video Lectures by Prof. Kamakoti – IIT Bombay (Not available on NPTEL. You can get it from current student of IIT Bombay or take it from me. I have Video Lectures of 2013 Pass out Batch)
3) Good grasp on OS implementation on Linux and Pint OS.
4) Detail Knowledge of How Threading is implemented in JAVA


Computer Networks:
1) Video Lectures by Prof. Sujoy Ghosh – IIT Kharagpur (Available on NPTEL)
2) Good grasp on Linux Networking (Servers and Networking Commands)


DBMS :
1) SQL Queries.
2) Database Implementation in MY SQL (Using B trees)
3) Indexing and Hashing in DBMS
4) Drawbacks of SQL Database
5) No SQL Database – Graph and Document Type Database and how they solve the problems
6) Every minute detail of the Database you have created in your DBMS Project.


Data Structures and Algorithms:
1) Video Lectures on Data Structures by Prof Naveen Garg – IIT Delhi (Available on NPTEL)
2) Video Lectures on Data Structure and Algorithm by Prof. Charles Leiserson and Prof. Erik Demaine - MIT.
3) TextBook – “Data Structures and Algorithms made Easy” by Karumanchi
4) TextBook – “Cracking the Coding Interview” by Gayle Laakmann Founder and CEO, CareerCup.com
5) GeeksforGeeks6) Company Specific Preparation by Practicing Previous Interview Papers


Programming Practices:
1) Codechef or Any other Coding Website: Experience helps to increase your Programming Speed, definitely useful in qualifying Coding Round
2) Standard Template Library in C++ for faster Coding - Hacker Rank Tutorial


Other Stuff to Study:
1) Brain Teasers
2) Design Problems (asked by Companies like Adobe. Detailed Example in Karumanchi Textbook)
3) Logical And Aptitude Preparation – Arun Sharma TextBook
4) HR Interview preparation from Indiabix.com

Round: Other Interview
Experience: Around 17 students were shortlisted. The resumes of students and their academic projects were given importance while shortlisting for this round. It started at around 10PM.



Questions of Interview Round III –



1) There is a big file containing numbers and we have to sort all of them.



I mentioned the approach mentioned in GeeksforGeeks that for example the available RAM for this purpose is 100 MB. So we can break the File in chunks of 100 Mb and bring the chunks in Memory and first sort them individually. Then we can prepare a heap containing first elements from all chunks. And keep extracting min from heap and replace it by next smallest element of the chunk it belongs. Then he asked if the number of chunks being formed here are very large, that is the heap I am preparing won’t fit in 100MB, then what to do. I suggested some further modifications and finally he was satisfied with the solution.



2) How to implement word suggestions like that in Eclipse.



I explained that it can be done using Tree Data Structure or using some sort of multilevel hashing in combination with storing words in sorted form. He asked me time complexities and told me to think of further improvements. He wasn’t completely satisfied and moved onto the next question.



3) Given 2 integers a and b, the sequence which will be formed is a, b, a+b, a+2b….



i.e Current element = sum of the previous 2 elements.



So now given a number k, how to figure out if it lies in the sequence or not.



This Question is not as easy as it looks. Here a and b can be negative or positive so the Generated Sequence can contain all positive or all negative or alternate occurrence of positive and negative element in sequence. So till which point should we generate the sequence and decide that k can or cannot lie in the sequence. I wrote a code but he mentioned few test cases in which my code was failing. After a few modifications I was able to write a satisfactory code solving all the test cases.

Round: Other Interview
Experience: I answered both the questions and also mentioned  solution to kth largest if Deletion operation is also there and if it is not. Then he told me to write the code for Heapify Function. Again there were some discussion regarding my Projects.

Round: Other Interview
Experience: Questions of Interview Round V -
This round started with a detailed discussion about my Summer Internship Project in Wooqer. After that I was asked to introduce myself. Then he asked me -

1) Given an Infix expression, how to evaluate its answer.

I was asked to write the code for it covering all the cases and I was given half an hour to do it. I wrote it in about 15-20 minutes. Interview of 4th Round got over by about 9 PM, and the results were declared by 11PM.
Tips: Amazon mostly focuses on – Tries, Big Data, Hashing, Strings. Apart from my general preparation for the Interview, I had gone through around 60 Amazon Interview Papers available on GeeksforGeeks, so I was totally aware of the kind of Questions I would be facing in the Interview, and prepared myself accordingly. In this year’s Amazon Interviews mostly the questions asked were not directly from GeeksforGeeks. And few questions which were picked directly from GeeksforGeeks, the solution they were expecting for it was better than that mentioned in GeekforGeeks. But to guess such a solution, one should surely be aware of all the existing solutions in GeeksforGeeks.

General Tips: Self Projects have a very high weight age in one's selection because this is one of the many things that distinguishes you from other candidates sitting in the Interview. It also shows your capabilities and your field of Interest. Also, Summer Internship surely matters a lot in Companies like Amazon. There was a very detail discussion of my Internship at Wooqer during the Interview Process at Amazon so be prepared.
College Name: NIT JAIPUR

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Indiamart Intermesh Interview FAQs

How many rounds are there in Indiamart Intermesh Software Engineer interview?
Indiamart Intermesh interview process usually has 3 rounds. The most common rounds in the Indiamart Intermesh interview process are Coding Test, HR and Resume Shortlist.
How to prepare for Indiamart Intermesh Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Indiamart Intermesh. The most common topics and skills that interviewers at Indiamart Intermesh expect are PHP, HTML, Javascript, Rabbitmq and Software Engineering.
What are the top questions asked in Indiamart Intermesh Software Engineer interview?

Some of the top questions asked at the Indiamart Intermesh Software Engineer interview -

  1. this was my final round and this was not so difficult than i expec...read more
  2. What is the experience in t...read more
  3. What are your proje...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Indiamart Intermesh

No Interviews

INTERVIEWS

Indiamart Intermesh

No Interviews

SALARIES

Muthoot Finance

SALARIES

Leuze Electronic

SALARIES

Leuze Electronic

SALARIES

Leuze Electronic

INTERVIEWS

Muthoot Finance

70 top interview questions

INTERVIEWS

Indiamart Intermesh

No Interviews

Tell us how to improve this page.

Indiamart Intermesh Software Engineer Interview Process

based on 5 interviews

1 Interview rounds

  • Coding Test Round
View more
Indiamart Intermesh Software Engineer Salary
based on 200 salaries
₹5 L/yr - ₹16.1 L/yr
40% more than the average Software Engineer Salary in India
View more details

Indiamart Intermesh Software Engineer Reviews and Ratings

based on 33 reviews

3.6/5

Rating in categories

3.4

Skill development

3.6

Work-life balance

3.2

Salary

4.4

Job security

3.4

Company culture

3.0

Promotions

3.3

Work satisfaction

Explore 33 Reviews and Ratings
Assistant Manager
2.6k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
1.2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Manager
891 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Executive
674 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Relationship Manager
656 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Indiamart Intermesh with

Alibaba Group

4.1
Compare

TradeIndia (Infocom Network Private Limited)

3.4
Compare

Global Sources

4.1
Compare

ExportersIndia

4.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview