Filter interviews by
Top trending discussions
Using Set and spread operator to get unique elements in an array.
Create a Set from the array using Set constructor
Use spread operator to convert Set back to array
Alternatively, use Array.from() method to convert Set to array
Coding question of react application.
I applied via Naukri.com and was interviewed in Jan 2024. There were 3 interview rounds.
Reading values from URL using map vs for loop in JavaScript
Use the window.location.search property to get the query string from the URL
Map can be used to transform each value in the query string array
For loop can be used to iterate through each value in the query string array
Create a UI component to display matched results in a dropdown
Use HTML, CSS, and JavaScript to create the dropdown component
Implement a search functionality to filter and display matched results
Use event listeners to handle user interactions like selecting a result
Frontend design involves creating the user interface of a website or application.
Focus on user experience and usability
Use responsive design for different screen sizes
Implement accessibility features for users with disabilities
I applied via Naukri.com and was interviewed in Jul 2022. There were 4 interview rounds.
Speed distance time basic
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.
I appeared for an interview before Dec 2020.
Round duration - 90 Minutes
Round difficulty - Medium
This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...
Find the minimum cost to buy a specific weight of oranges using given cost list.
Iterate through the cost list and find the minimum cost to achieve the desired weight
Keep track of the minimum cost while considering available packet weights
Return -1 if it is not possible to buy exactly W kg of oranges
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using DFS and keep track of the current path and its sum.
At each node, check if the current sum equals 'K' and add the path to the result if true.
Continue traversal to the left and right child nodes recursively.
Return the list of paths that sum up to 'K'.
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
Burn both wires at the same time, one wire will burn faster than the other.
Measure the time it takes for the faster burning wire to completely burn.
Calculate the specific amount of time by using the ratio of the lengths of the two wires.
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
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.
I applied via Approached by Company and was interviewed in Oct 2024. There were 4 interview rounds.
2 DSA questions and some MCQ on Java and Spring
Remove duplicates from a 1D array of strings in place
Iterate through the array and use a HashSet to keep track of unique elements
Replace duplicates with null or an empty string to remove them in place
String arrays are immutable because they cannot be changed once created.
Strings in an array cannot be modified individually
Any changes to a string array result in a new array being created
Immutable arrays ensure data integrity and prevent unintended side effects
To create a custom immutable class, use final keyword for class, private final fields, and no setter methods.
Use the final keyword for the class to prevent inheritance
Declare all fields as private and final to prevent modification
Do not provide setter methods for the fields to maintain immutability
Provide getter methods to access the fields
I applied via Campus Placement and was interviewed in Mar 2024. There were 3 interview rounds.
Coding test contains 2 questions 1 moderate and 1 easy level
I am a passionate software developer with experience in Java, Python, and web development.
Graduated with a degree in Computer Science
Worked on various projects using Java and Python
Familiar with web development technologies like HTML, CSS, and JavaScript
I believe Lowe's is a reputable company with a strong focus on customer satisfaction. They can improve their customer services by implementing personalized recommendations, enhancing their online platform, and providing better in-store experiences.
Implement personalized recommendations based on customer preferences and purchase history
Enhance the online platform for easier navigation, product search, and checkout proce...
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java and Python programming languages
Proficient in web development technologies such as HTML, CSS, and JavaScript
Strong problem-solving skills and ability to work in a team environment
Developed a web application for tracking personal fitness goals
Used React.js for front-end development
Implemented RESTful APIs for data retrieval and storage
Utilized MongoDB for database management
based on 1 interview experience
Assistant Manager
22
salaries
| ₹5.7 L/yr - ₹14 L/yr |
Sales Executive
19
salaries
| ₹3.2 L/yr - ₹7.5 L/yr |
Sales Associate
14
salaries
| ₹3.2 L/yr - ₹5.4 L/yr |
Senior Manager
12
salaries
| ₹17 L/yr - ₹31 L/yr |
Associate
12
salaries
| ₹2 L/yr - ₹4.8 L/yr |
Reliance Retail
DMart
Reliance Digital
Vishal Mega Mart