Filter interviews by
Clear (1)
I applied via Referral and was interviewed before Aug 2022. There were 3 interview rounds.
Top trending discussions
I applied via Company Website and was interviewed before Jun 2021. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed before Nov 2022. There were 3 interview rounds.
I applied via Referral and was interviewed before Oct 2020. There was 1 interview round.
Lifo and fifo are inventory management methods used to track the flow of goods.
Lifo stands for Last In, First Out, meaning the most recently received items are sold first.
Fifo stands for First In, First Out, meaning the oldest items in inventory are sold first.
Lifo is often used for products with a short shelf life, while fifo is used for products with a longer shelf life.
For example, a grocery store might use fifo for...
I applied via Referral and was interviewed in Feb 2021. There was 1 interview round.
My design process involves thorough research, ideation, prototyping, testing, and iteration.
I start by researching the problem and the target audience.
Then I brainstorm and ideate potential solutions.
Next, I create prototypes to test and gather feedback.
Based on the feedback, I iterate and refine the design.
Finally, I deliver the final product or design solution.
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
There were 2 coding questions given in this round. One was related to Dynamic Programming and the second one was related to Recursion and Number Theory.
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
House Robber problem where a robber wants to maximize stolen money without robbing adjacent houses in a circular street.
Use dynamic programming to keep track of maximum stolen money at each house.
Consider two cases: either rob the current house and skip the next, or skip the current house.
Handle circular arrangement by considering the first and last houses separately.
Example: For arr[] = {2, 3, 2}, the output is 3. Rob...
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Example: For N = 5, the 5th F
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round where I was given 2 questions to solve , one was from Linked List and the other was related to Priority Queue / Quick Sort .
You are provided with two linked lists, L1
and L2
, both sorted in ascending order. Generate a new linked list containing elements that exist in both linked l...
Given two sorted linked lists, find the intersection of elements in both lists and return a new sorted linked list.
Traverse both linked lists simultaneously to find common elements
Create a new linked list to store the intersecting elements
Ensure the final linked list is sorted in ascending order
Handle cases where there are no common elements between the lists
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
The first line contains an integer 'T...
Find the Kth largest element in a given list of numbers.
Sort the array in descending order.
Return the Kth element from the sorted array.
Handle multiple test cases efficiently.
Round duration - 50 Minutes
Round difficulty - Easy
This round majorly focused on Real life appications of Data Structures and also revolved around Object Oriented Programming Style of writing code .
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...
Design a data structure with insert, delete, search, and getRandom operations, all in constant time.
Use a combination of HashMap and ArrayList to achieve constant time operations.
For insert operation, add the element to the ArrayList and store its index in the HashMap.
For delete operation, swap the element to be deleted with the last element in the ArrayList, update the index in the HashMap, and then remove the last el...
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.
Implement a doubly linked list to maintain the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the position of a key in the linked list whenever it is accesse
Round duration - 45 Minutes
Round difficulty - Medium
This round was inclined towards some Low Level Design Principles and some concepts from Java .
Design a Railway Reservation System
Create a database to store train schedules, seat availability, and passenger information
Implement a user interface for users to search for trains, book tickets, and view their reservations
Include features like seat selection, payment processing, and ticket confirmation
Handle scenarios like waitlisting, cancellations, and refunds
Ensure data security and privacy of passenger information
Java is platform-independent because the code is compiled into bytecode that can run on any platform with a JVM, which is platform-dependent due to its reliance on the underlying hardware and operating system.
Java code is compiled into bytecode, which can run on any platform with a JVM.
JVM acts as an interpreter that translates bytecode into machine code specific to the underlying hardware and operating system.
The JVM ...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 3 interviews
Interview experience
based on 16 reviews
Rating in categories
Software Engineer
1.1k
salaries
| ₹7.5 L/yr - ₹27 L/yr |
Senior Software Engineer
974
salaries
| ₹11.8 L/yr - ₹40 L/yr |
Senior Analyst
237
salaries
| ₹7.5 L/yr - ₹29 L/yr |
Analyst
214
salaries
| ₹4 L/yr - ₹16.8 L/yr |
Lead Software Engineer
155
salaries
| ₹18 L/yr - ₹60 L/yr |
Home Depot
Ace Hardware
Menards
Sherwin Williams Paints