i
DMI
Filter interviews by
I applied via Referral and was interviewed in Jul 2021. There were 5 interview rounds.
I applied via Approached by Company
I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.
To connect to the backend, you can use APIs, database connections, or web services.
Use APIs to send and receive data between the frontend and backend
Establish database connections to retrieve and store data
Utilize web services for communication between different systems
posted on 31 May 2022
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Easy
Timing - 10AM-11:30AM
Online proctored test
Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes visible when the tree is viewed from the righ...
The task is to print the right view of a binary tree, representing nodes visible from the right side in top-to-bottom order.
Traverse the tree level by level and keep track of the rightmost node at each level
Print the rightmost node of each level to get the right view of the tree
Use a queue for level order traversal and a map to store the rightmost nodes
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Round duration - 45 minutes
Round difficulty - Medium
Timing : 4PM-5PM
Environment - Online
There was a panel of 3 interviewers
You can find the size of an array in C or C++ by dividing the total size of the array by the size of one element.
Calculate the total size of the array by multiplying the number of elements by the size of each element.
Divide the total size by the size of one element to get the size of the array.
For example, if you have an array of strings arr[] = {'hello', 'world', 'example'}, you can find the size by dividing the total
B+ trees are used for indexing in databases to efficiently search and retrieve data.
B+ trees are balanced trees where each node can have multiple keys and child pointers.
Data is stored in leaf nodes, while non-leaf nodes are used for navigation.
B+ trees are commonly used in databases because of their ability to efficiently search and retrieve data.
Example: In a database table with an index on a specific column, B+ tree...
Round duration - 45 mintues
Round difficulty - Easy
Timing - 11AM-12:15PM
Environment - online video call
Again there was a panel of 2 senior engineers
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
For the giv...
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes while keeping track of the sum of each path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) or breadth-first search (BFS) for tree traversal.
Handle cases where nodes have negative values or where
Tip 1 : Brush Up on Computer Science Fundamentals
Tip 2 : Prepare a Brief Self-Introduction
Tip 1 : Do not put fake resume
Tip 2 : Writing internship project helps.
posted on 28 Jun 2024
I applied via Job Portal and was interviewed before Jun 2023. There was 1 interview round.
Recursion tree for a given code
Identify the base case of the recursion
Draw a tree structure with each recursive call as a node
Label each node with the input parameters and return values
I applied via Google and was interviewed in Mar 2021. There was 1 interview round.
posted on 2 Feb 2022
There was online aptitude test
There was pattern design coding
posted on 22 Jun 2022
I applied via Campus Placement and was interviewed in May 2022. There were 2 interview rounds.
I am a software developer with experience in web development and a passion for problem-solving.
Experienced in web development using HTML, CSS, and JavaScript
Proficient in programming languages such as Java and Python
Familiar with frameworks like React and Angular
Strong problem-solving and analytical skills
Ability to work well in a team and communicate effectively
posted on 26 Apr 2024
I applied via Approached by Company and was interviewed in Oct 2023. There was 1 interview round.
posted on 10 Jan 2025
I applied via Company Website and was interviewed before Jan 2024. There were 3 interview rounds.
Good questions and dsa arrays and string questions
Senior Software Engineer
144
salaries
| ₹8.2 L/yr - ₹31 L/yr |
Software Engineer
88
salaries
| ₹4 L/yr - ₹14.5 L/yr |
Associate Software Engineer
51
salaries
| ₹3.3 L/yr - ₹9 L/yr |
Principal Software Engineer
42
salaries
| ₹12.1 L/yr - ₹38.8 L/yr |
QA Engineer
35
salaries
| ₹4 L/yr - ₹11 L/yr |
TCS
Infosys
Wipro
HCLTech