Filter interviews by
Be the first one to contribute and help others!
posted on 29 Jun 2015
posted on 29 Jun 2015
posted on 25 Nov 2021
I applied via Campus Placement and was interviewed in Oct 2021. There was 1 interview round.
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
posted on 9 Oct 2021
I applied via Campus Placement and was interviewed before Oct 2020. There was 1 interview round.
posted on 6 Aug 2021
Write a query
Specify the database and table name
List the columns to be selected
Add any conditions or filters
Specify the order of results
posted on 24 Mar 2021
posted on 10 Oct 2021
I applied via Campus Placement
The aptitutde test was entirely based on your logical reasoning and aptitude handling skills.
posted on 31 May 2022
I was interviewed in Sep 2021.
Round duration - 150 Minutes
Round difficulty - Medium
3 coding question + 50 dsa
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
You are provided with an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. The task is to determine the height of the tree.
Calculate the height of a binary tree given its level order traversal.
Traverse the binary tree level by level and keep track of the height as you go down the tree.
Use a queue data structure to perform level order traversal efficiently.
The height of a binary tree is the maximum number of edges from the root to any leaf node.
Handle NULL nodes represented by -1 in the input.
Return the height of the binary tree as a single
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.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and count the number of connected components.
Maintain a visited array to keep track of visited cells to avoid counting the same island multiple times.
Iterate through each cell in the matrix and if it is a land (1) and not visited, perform DFS/BFS to explore the connected land cells.
I...
Round duration - 60 Minutes
Round difficulty - Hard
2 coding questions
You are given 'N' pairs of integers where the first number is always smaller than the second number, i.e., in pair (a, b) -> a < b always. A pair chain is...
Find the length of the longest pair chain that can be formed using the given pairs.
Sort the pairs based on the second element in ascending order.
Iterate through the sorted pairs and keep track of the maximum chain length.
Update the chain length if the current pair can be added to the chain.
Return the maximum chain length at the end.
You are given an array prices
, representing stock prices over N consecutive days. Your goal is to compute the maximum profit achievable by performing multiple transactions (i...
Find maximum profit by buying and selling stocks multiple times.
Iterate through the array and find all increasing sequences of stock prices.
Calculate profit by buying at the start and selling at the end of each increasing sequence.
Sum up all profits to get the maximum profit achievable.
Round duration - 45 minutes
Round difficulty - Medium
Data structures,java script,web dev related questions,dbms questions
Designing a web crawler involves defining the scope, selecting a crawling strategy, implementing the crawler, handling data storage, and ensuring politeness.
Define the scope of the web crawler by determining the websites to crawl and the depth of the crawl.
Select a crawling strategy such as breadth-first or depth-first search based on the requirements.
Implement the web crawler using a programming language like Python o...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 3 : practice basics of dsa
Tip 1 : show your projects
Tip 2 : highlight your skills
based on 17 reviews
Rating in categories
Accountant
4
salaries
| ₹0 L/yr - ₹0 L/yr |
General Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Service Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Coca-Cola Company
Dhoot Transmission
Genius Consultants
Apotex Research