Filter interviews by
I was interviewed 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'...
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...
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...
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...
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
posted on 2 Jun 2023
I applied via campus placement at Indian Institute of Technology (IIT), Mumbai and was interviewed in Dec 2022. There were 4 interview rounds.
2 questions dsa based
posted on 16 Dec 2024
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
The aptitude test was relatively straightforward, consisting of both aptitude and technical questions, with a difficulty level ranging from easy to medium.
posted on 26 Dec 2024
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
I am a Software Development Engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
Experience in developing web applications
Good team player
posted on 17 Jan 2025
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
Divide the input array into two halves
Recursively sort the two halves
Merge the sorted halves back together
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
Choose a pivot element from the array.
Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.
Recursively apply the same process to the sub-arrays.
Combine the sorted sub-arrays to get the final sorted array.
posted on 27 Nov 2024
I applied via Company Website and was interviewed in Apr 2024. There were 3 interview rounds.
posted on 29 Sep 2024
Queue question - create queue from array
QA Lead
8
salaries
| ₹19 L/yr - ₹25 L/yr |
Operations Associate
7
salaries
| ₹5 L/yr - ₹7.2 L/yr |
Senior Software Developer
4
salaries
| ₹22 L/yr - ₹53 L/yr |
Senior Associate Operations
4
salaries
| ₹6.8 L/yr - ₹7.7 L/yr |
Software Engineer
3
salaries
| ₹15 L/yr - ₹20 L/yr |
Myntra
Koovs
Vogue
Elle India