Filter interviews by
I appeared for an interview before Nov 2020.
Round duration - 90 minutes
Round difficulty - Medium
Proctored Online Test On Mettl.
You are given an array/list CHOCOLATES
of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...
Distribute chocolates among students to minimize difference between largest and smallest packets.
Sort the array of chocolates packets.
Use sliding window technique to find the minimum difference between largest and smallest packets.
Return the minimum difference as the output.
Round duration - 60 minutes
Round difficulty - Easy
There were two Interviewers.
Interview started with an introduction.
Questions were asked from my projects.
Questions from Linked Lists, Trees, Graphs were asked.
You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return true
if it is a pali...
Check if a given singly linked list is a palindrome or not.
Use two pointers approach to find the middle of the linked list
Reverse the second half of the linked list
Compare the first half with the reversed second half to determine if it's a palindrome
Round duration - 60 minutes
Round difficulty - Easy
More questions from DSA were asked.
Questions from DBMS, SQL, OS were asked in the end.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to efficiently implement the LRU cache.
Keep track of the least recently used item and update it accordingly when inserting new items.
Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.
Implement get(...
Given an undirected graph as an adjacency matrix and an integer M
, determine whether you can color the vertices of the graph using at most M
colors such that no two adjacent v...
The M-Coloring Problem involves coloring the vertices of a graph using at most M colors such that no two adjacent vertices share the same color.
Check if the graph can be colored using at most M colors without any adjacent vertices sharing the same color.
Use backtracking or graph coloring algorithms to solve the problem efficiently.
Ensure that the number of colors used is less than or equal to M.
Consider the constraints...
Tip 1 : Learn Data Structures and Algorithms. Practice atleast 300 (150 Medium + 100 Easy + 50 Hard) coding questions from Geeksforgeeks or Leetcode.
Tip 2 : Learn OOPS, OS, DBMS.
Tip 3 : Do atleast 2 projects.
Tip 1 : Don't mention unnecessary things on resume.
Tip 2 : Be precise and use good template.
Top trending discussions
I appeared for an interview before Jun 2016.
I appeared for an interview before Aug 2016.
I appeared for an interview before May 2016.
I appeared for an interview in Mar 2017.
To make the red fishes 98%, 50 fishes have to be removed from the aquarium.
Calculate 1% of 200 fishes to find the number of red fishes.
Subtract the number of red fishes from 200 to find the number of non-red fishes.
Calculate 2% of the total number of fishes to find the desired number of red fishes.
Subtract the desired number of red fishes from the current number of red fishes to find the number of fishes to be removed.
posted on 28 Jun 2017
I appeared for an interview in Mar 2017.
To make the red fishes 98%, 50 fishes have to be removed from the aquarium.
Calculate 1% of 200 fishes to find out how many fishes represent 1%.
Multiply the result by 2 to find out how many fishes represent 2%.
Subtract the result from 200 to find out how many fishes represent 98%.
I appeared for an interview in Feb 2017.
posted on 3 May 2017
I appeared for an interview before May 2016.
I appeared for an interview in Mar 2017.
To make the red fishes 98%, 50 fishes have to be removed from the aquarium.
Calculate 1% of 200 fishes, which is 2 fishes.
To make the red fishes 98%, subtract 1% (2 fishes) from 99% (198 fishes).
To find the number of fishes to be removed, divide the difference by 1% (2 fishes).
Therefore, 50 fishes have to be removed to make the red fishes 98%.
I applied via Company Website and was interviewed before Dec 2019. There were 3 interview rounds.
QA Lead
8
salaries
| ₹19 L/yr - ₹25 L/yr |
Operations Associate
7
salaries
| ₹5 L/yr - ₹7.5 L/yr |
Supervisor
7
salaries
| ₹35 L/yr - ₹70 L/yr |
Assistant Manager
4
salaries
| ₹9.5 L/yr - ₹13 L/yr |
Senior Software Developer
4
salaries
| ₹22 L/yr - ₹53 L/yr |
Marpu Foundation
Huawei Technologies
HCL Infosystems
Z X Learning