Filter interviews by
I applied via Naukri.com and was interviewed in Jul 2021. There were 3 interview rounds.
Top trending discussions
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2021. There were 4 interview rounds.
90 minute test on hacker rank consisting of 3 coding questions all of medium difficulty. Most candidates are required to solve more than 1 question.
Find the lowest common ancestor of a binary tree.
Traverse the tree recursively from the root node.
If the current node is null or matches either of the given nodes, return the current node.
Recursively search for the nodes in the left and right subtrees.
If both nodes are found in different subtrees, return the current node.
If both nodes are found in the same subtree, continue the search in that subtree.
Find first missing positive integer from an array of non-negative integers.
Create a hash set to store all positive integers in the array
Loop through the array and add all positive integers to the hash set
Loop through positive integers starting from 1 and return the first missing integer not in the hash set
Design a parking lot
Consider the size and capacity of the parking lot
Decide on the layout and organization of parking spaces
Implement a system to manage parking availability and reservations
Include features like ticketing, payment, and security
Consider scalability and future expansion
Group list of strings into distinct anagrams.
Create a hash table with sorted string as key and list of anagrams as value.
Iterate through the list of strings and add each string to its corresponding anagram list in the hash table.
Return the values of the hash table as a list of lists.
posted on 10 Nov 2015
I appeared for an interview before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
Dont't remember the exact questions
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
Simple DBMS and DSA Questions
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
Coding round consisting DSA portion mainly.
Senior Engineer
133
salaries
| ₹4.8 L/yr - ₹16 L/yr |
Design Engineer
101
salaries
| ₹3 L/yr - ₹6.5 L/yr |
Senior Design Engineer
71
salaries
| ₹4 L/yr - ₹10.5 L/yr |
Engineer
63
salaries
| ₹3.2 L/yr - ₹7 L/yr |
Team Lead
56
salaries
| ₹7.5 L/yr - ₹15.7 L/yr |
CMS IT Services
Tekwissen
Softenger
Quantiphi Analytics Solutions Private Limited