Filter interviews by
Retail is the process of selling goods or services directly to consumers through various channels.
Retail involves the sale of products or services to end-users
It includes various channels such as brick-and-mortar stores, online marketplaces, and mobile apps
Retailers purchase products from manufacturers or wholesalers and sell them to consumers at a markup
Retailers focus on providing a positive customer experience to dr...
Excellent customer service means providing prompt, personalized, and effective solutions to customers' needs and concerns.
Promptly responding to customer inquiries and complaints
Tailoring solutions to meet individual customer needs
Going above and beyond to exceed customer expectations
Providing clear and concise communication
Ensuring customer satisfaction and loyalty
Examples: Offering a refund or replacement for a defec...
Top trending discussions
I was interviewed 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 was interviewed 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 was interviewed before Jul 2016.
I want to join Croma because of its reputation and growth opportunities. To sell Croma brand and others, I will focus on understanding customer needs and providing personalized solutions.
Croma has a strong brand reputation and is a leader in the electronics retail industry
I am excited about the growth opportunities and potential for career advancement at Croma
To sell Croma brand and others, I will focus on building rel...
I have a Bachelor's degree in Business Administration with a focus on Marketing.
Bachelor's degree in Business Administration
Focus on Marketing
Relevant coursework in sales and marketing strategies
Internship experience in sales and customer relations
I am currently staying in New York City.
I am currently residing in the heart of Manhattan.
I have been living in New York City for the past two years.
I enjoy the vibrant culture and opportunities that the city offers.
Two DSA ques were asked. One easy and one medium.
I applied via Naukri.com and was interviewed in Feb 2024. There were 4 interview rounds.
Ask you to implement any solution like caching using LRU or LFU
Its a manager round where they discuss about u=your past experiences and also they tell you about the project
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There were 2 interview rounds.
Immutable class, remove duplicates from string using Java 8
Create an immutable class to represent the string
Use Java 8 streams to remove duplicates from the string
Convert the string to a character array, use distinct() and collect() to remove duplicates
Sealed classes in Java restrict inheritance to a predefined set of subclasses.
Sealed classes were introduced in Java 15 to restrict inheritance to a predefined set of subclasses.
Subclasses of a sealed class must be declared in the same file as the sealed class.
Sealed classes are declared using the 'sealed' modifier before the 'class' keyword.
Example: sealed class Shape permits Circle, Square, Triangle;
Fallout mechanism between microservices refers to how failures in one microservice can impact other microservices.
Fallout can occur due to cascading failures when one microservice depends on another.
Implementing circuit breakers can help prevent fallout by isolating failures.
Monitoring and alerting systems are crucial for detecting and responding to fallout.
Using asynchronous communication can reduce the impact of fall...
I applied via Naukri.com and was interviewed before Mar 2023. There were 2 interview rounds.
HashSet is a collection that stores unique elements using a hash table.
Uses hashing to store elements
Does not allow duplicate elements
Provides constant-time performance for basic operations like add, remove, contains
I resolve conflicts by actively listening, understanding all perspectives, finding common ground, and proposing solutions.
Actively listen to all parties involved
Understand each perspective and the underlying reasons for conflict
Find common ground and areas of agreement
Propose solutions that address the concerns of all parties
based on 59 reviews
Rating in categories
Assistant Store Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Restaurant Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Store Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Restaurant General Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
DMart
Future Group
Reliance Digital
Vishal Mega Mart