Filter interviews by
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
Round duration - 60 minutes
Round difficulty - Medium
This was the technical round, held around at 10 AM IST on Google Meet.
Firstly she greeted me and asked me to tell something about myself, to which I introduced myself, explaining my academic and some projects also.
After that we moved on to the Hackathon project, which was smart cart self-checkout system. I explained the project along with the code, wherever necessary.
Every word you say while explaining should be clear to you.I used Firebase and SQL while explaining my project, to which she asked some questions related to it,
Then she moved to the DBMS part, types of joins,what is indexing, how to approach if you were to design a payment system.
At last she asked me some Data Structure questions, which were of medium complexity
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list given the position 'K'.
Traverse the list to find the length 'N' of the linked list.
Calculate the position of the node to be removed from the beginning as 'N - K + 1'.
Traverse the list again and remove the node at the calculated position.
Consider Mr. X, a professional robber who is planning to rob houses along a street. These houses are arranged in a circle, which means the first house is a neighbor to the l...
House Robber problem where adjacent houses have connected security system, find maximum money Mr. X can rob without triggering security.
Use dynamic programming to keep track of maximum money robbed at each house.
At each house, decide whether to rob the current house or skip it based on maximum money robbed so far.
Handle the circular nature of houses by considering two cases: robbing the first house and not robbing the ...
Round duration - 30 minutes
Round difficulty - Easy
The interviewer was very frank and cheerful. This was held at 2:30 PM IST on Google Meet.
He firstly greeted me and asked me how I was doing.
How was my previous round, any technical difficulties?
Then he asked me to introduce myself.
He started telling about his journey to Lowe's and his technical background.
Then he asked some HR related questions
Tip 1 : Practice DSA questions, interview questions as much as you can.(400 leetcode questions) + (1000+ geeksforgeeks score) is good approximation of your preparation.
Tip 2 : You should have a good internship experience or 1 or 2 good projects on Android/web-d or Machine Learning.You should be through with your projects and be able to tell further improvements for the future.
Tip 3 : Be CONFIDENT with what you say. Don't murmur or speak in the mouth.The interviewer wants to know your thought process.
Tip 1 : Resume is the first impression of you.so it must be very eye-catching. write some decent (maybe 1 or 2 is enough) projects on resume.
Tip 2 : Should be through with each and every point you have written on your resume. people usually write 10- 15 skills on resume while confident in only 5.Please don't do it.
I applied via Approached by Company and was interviewed in Feb 2024. There was 1 interview round.
A bean in Spring is a Java object that is instantiated, assembled, and managed by the Spring IoC container.
Beans are defined in the Spring configuration file using XML or annotations.
Beans are singleton by default but can be configured as prototype.
Beans can have dependencies injected by the container.
Example: @Component annotation in Spring creates a bean.
Example:
I applied via LinkedIn and was interviewed before Oct 2023. There was 1 interview round.
Design a URL shortener system
Use a unique identifier for each long URL to generate a short URL
Store the mapping of short URL to long URL in a database
Implement a redirect mechanism to redirect short URLs to their corresponding long URLs
Consider scalability and performance while designing the system
Use Floyd's Tortoise and Hare algorithm to detect cycle in a linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If they meet at any point, there is a cycle in the linked list.
I applied via Approached by Company and was interviewed before Jul 2023. There were 3 interview rounds.
Mostly dynamic programming and tree based programs
Java-based coding, streams and lambda, design patterns
I applied via Campus Placement and was interviewed in Oct 2023. There were 2 interview rounds.
2 coding questions from dsa. one quest was from trees ds
based on 1 interview experience
Department Manager
213
salaries
| ₹1.8 L/yr - ₹4.5 L/yr |
Store Manager
150
salaries
| ₹2.8 L/yr - ₹9 L/yr |
Customer Service Associate
120
salaries
| ₹1 L/yr - ₹2.7 L/yr |
Assistant Store Manager
89
salaries
| ₹3 L/yr - ₹7 L/yr |
Cashier
75
salaries
| ₹0.6 L/yr - ₹3.8 L/yr |
Vishal Mega Mart
Titan Company
Shoppers Stop
Landmark Group