i
Indiamart
Intermesh
Filter interviews by
I appeared for an interview in Feb 2025.
Nice interview experience with easy questions
I have extensive experience in software development, focusing on full-stack development, agile methodologies, and collaborative teamwork.
Developed a web application using React and Node.js, improving user engagement by 30%.
Led a team of 5 in an agile environment, successfully delivering projects on time and within budget.
Implemented RESTful APIs for a healthcare application, ensuring data security and compliance with H...
I applied via Campus Placement
Basics questions were asked
Questions about python and java
They were given a topic about the students preferring studying in foreign countries than India
I appeared for an interview before May 2024, where I was asked the following questions.
Preorder, postorder, and inorder traversals differ in node visiting order in binary trees.
Preorder: Visit root, then left subtree, then right subtree. Example: For tree 1-2-3, traversal is 1, 2, 3.
Postorder: Visit left subtree, then right subtree, then root. Example: For tree 1-2-3, traversal is 2, 3, 1.
Inorder: Visit left subtree, then root, then right subtree. Example: For tree 1-2-3, traversal is 2, 1, 3.
A database query using a join combines rows from two or more tables based on a related column.
Joins are used to retrieve data from multiple tables in a relational database.
Common types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL OUTER JOIN.
Example of an INNER JOIN: SELECT * FROM Orders INNER JOIN Customers ON Orders.CustomerID = Customers.CustomerID;
LEFT JOIN retrieves all records from the left table a...
I appeared for an interview in Dec 2021.
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.
Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.
Integer N
Prime numbers printed on separate lines
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
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...
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'.
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.
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...
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.
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.
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.
I appeared for an interview before Apr 2023.
Coding+ apti + quant
Top trending discussions
I appeared for an interview in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl...
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit...
Construct a binary tree of height h and merge bottom nodes to create a cone-like structure.
A binary tree of height h has 2^h - 1 nodes.
Start combining leaf nodes from the bottom level upwards.
Each combination can be visualized as merging two nodes into one.
For example, if h=3, the tree has 7 nodes, and you combine nodes at levels 2 and 1.
The final structure resembles a cone as nodes are merged.
based on 7 interview experiences
Difficulty level
Duration
based on 34 reviews
Rating in categories
Assistant Manager
2.6k
salaries
| ₹2.5 L/yr - ₹9 L/yr |
Senior Executive
1.2k
salaries
| ₹2 L/yr - ₹5.5 L/yr |
Manager
926
salaries
| ₹3.4 L/yr - ₹10 L/yr |
Sales Executive
743
salaries
| ₹1 L/yr - ₹5.6 L/yr |
Relationship Manager
663
salaries
| ₹3.6 L/yr - ₹9.6 L/yr |
Amazon
Flipkart
Udaan
BigBasket