i
Lenskart
Work with us
Filter interviews by
I appeared for an interview in Mar 2022.
Round duration - 60 minutes
Round difficulty - Medium
1 Medium/Easy DSA questions were asked similar to Leetcode.
I was expected to come up with the most optimal solution for the same. I completed the code and explained in 45 mins.
In the remaining time, I was asked questions from Computer Science fundamentals and Java
Nobita wants to impress Shizuka by correctly guessing her lucky number. Shizuka provides a sorted list where every number appears twice, except for her lucky number, which a...
Find the unique element in a sorted array where all other elements appear twice.
Use XOR operation to find the unique element in the sorted array.
Iterate through the array and XOR all elements, the result will be the unique element.
Time complexity of O(n) can be achieved by iterating through the array once.
Round duration - 60 minutes
Round difficulty - Easy
Low-level system design round.
Expected to come up with a running code.
Design and implement a Least Recently Used (LRU) cache data structure. This cache must support the following operations efficiently:
get(key)
: Return the value associate...Implement a Least Recently Used (LRU) cache data structure that supports get and put operations efficiently.
Design a data structure that maintains a cache with a specified capacity.
Implement get(key) function to return value associated with key or -1 if key doesn't exist.
Implement put(key, value) function to insert/update key-value pair in cache.
Invalidate least recently used item when cache reaches its capacity.
Handle...
Round duration - 30 minutes
Round difficulty - Easy
Standard behavioural questions by HR
Tip 1 : Break down the total topics based on your comfort and ease and try and master one topic at a time
Tip 2 : Try and up solve
Tip 3 : Always try and come up with multiple solutions for a DSA question starting from brute force to optimal solution.
Tip 1 : Try to keep it short and crisp.
Tip 2 : Always make the entries chronological with the most recent experiences coming first followed by past experiences.
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 1hour
Round difficulty - Hard
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
Use Breadth First Search (BFS) algorithm to find the shortest path from start to end cell.
Keep track of visited cells and the number of dice throws required to reach each cell.
Consider the presence of snakes and ladders while calculating the next possible moves.
Return the minimum number of dice throws to reach the last ...
Round duration - 1hour
Round difficulty - Hard
Mvvm architecture
Implement a stack using a queue in MVVM architecture
Use two queues to simulate a stack
Push operation: Enqueue the element to queue 1
Pop operation: Dequeue all elements from queue 1 to queue 2, dequeue the last element from queue 2 (which is the top of the stack)
Ensure proper synchronization between the two queues
Example: Push(1), Push(2), Pop() should return 2
Round duration - 1hour
Round difficulty - Easy
Tip 1 : be confident
Tip 2 : always say truth about your experience
Tip 3 : don't be nervous
Tip 1 : mentioned project u worked on
Tip 2 : technical skills
I applied via LinkedIn and was interviewed in Jun 2024. There was 1 interview round.
The minimum cost to connect the ropes is calculated by repeatedly connecting the two smallest ropes until all ropes are connected.
Sort the ropes in ascending order.
Repeatedly connect the two smallest ropes.
Add the cost of connecting the two ropes to the total cost.
Continue this process until all ropes are connected.
The question asks for the maximum value of arr[i]+arr[j]+i-j for given array arr.
Iterate through all possible pairs of i and j in the array
Calculate the value of arr[i]+arr[j]+i-j for each pair
Keep track of the maximum value found
I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 5 interview rounds.
2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question
A simple feed platform, which supports some basic functionality. The main point of this round was to see how well a candidate architect the application.
Scaling an application involves optimizing performance, managing load, and ensuring reliability as user demand increases.
Horizontal scaling: Add more machines to distribute load (e.g., using load balancers).
Vertical scaling: Upgrade existing machines with more resources (CPU, RAM).
Database sharding: Split databases into smaller, more manageable pieces to improve performance.
Caching strategies: Use caching layers (e.g.,...
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.
I appeared for an interview in May 2021.
Round duration - 120 minutes
Round difficulty - Medium
it was morning 10AM-12
friendly environment given by the interviewer
It was machine coding round, the problem statement was to create a online food ordering system with various features.
interviewer was good and supportive
Round duration - 60 Minutes
Round difficulty - Medium
timing noon 3-4Pm
good interviewer
interviwer was giving hints if required and all
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to sort the array in a single pass.
Initialize three pointers for 0, 1, and 2 values and iterate through the array.
Swap elements based on the values encountered to achieve the sorted array.
Example: Input array [0, 2, 1, 1] should be sorted as [0, 1, 1, 2].
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
For the giv...
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes, keeping track of the sum along the path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) to traverse the tree efficiently.
Handle cases where nodes are absent (-1) by appropriately updating the pat...
Round duration - 90 Minutes
Round difficulty - Easy
evening 4-5:30PM
interviewer was good
very supportive and giving hints
Design a system for BookMyShow to allow users to book movie tickets.
Create a user-friendly website and mobile app for users to browse movies and showtimes.
Implement a secure payment gateway for users to purchase tickets online.
Develop a database to store movie information, showtimes, and user bookings.
Include features like seat selection, ticket confirmation, and booking history for users.
Integrate with cinema partners...
Round duration - 40 Minutes
Round difficulty - Easy
4-5 PM
Interviewer was good
I'm seeking new challenges and opportunities for growth that align with my career goals and aspirations.
Desire for professional growth: I'm looking for a role that offers more responsibilities and opportunities to lead projects.
Interest in new technologies: I want to work with cutting-edge technologies that can enhance my skills and knowledge.
Cultural fit: I'm seeking a company culture that aligns more closely with my ...
Tip 1 : Practice Atleast 200 Questions
Tip 2 : Practice company specific interview question
Tip 3 : Prepare resume nicely
Tip 1 : Prepare resume very nicely.
Tip 2 : don't mention any tech stack you are confident of.
I applied via Referral and was interviewed in Jan 2023. There were 3 interview rounds.
This was a machine coding round in which we have to implement an online cab booking service.
Standard problem solving round consists of two questions on tree and dp.
I applied via Referral and was interviewed in May 2017. There were 4 interview rounds.
Job timing refers to the specific hours and schedule an employee is expected to work.
Job timing can vary by industry; for example, retail jobs may require evening and weekend shifts.
In corporate settings, standard job timing is often 9 AM to 5 PM, Monday to Friday.
Flexible job timing allows employees to choose their hours, promoting work-life balance.
Some jobs, like healthcare, may require shift work, including nights ...
Salary cycle refers to the frequency at which employees are paid, such as weekly, bi-weekly, or monthly.
Salary cycle can vary depending on the company's policies and practices.
Common salary cycles include weekly, bi-weekly (every two weeks), semi-monthly (twice a month), and monthly.
Some companies may also offer different salary cycles for different employee groups, such as hourly vs. salaried employees.
Understanding t...
I applied via Referral and was interviewed before Mar 2017. There were 6 interview rounds.
Optometrist
952
salaries
| ₹1.8 L/yr - ₹5.2 L/yr |
Store Manager
915
salaries
| ₹2.5 L/yr - ₹6 L/yr |
Sales Executive
573
salaries
| ₹1.2 L/yr - ₹4.5 L/yr |
Sales Associate
394
salaries
| ₹1.2 L/yr - ₹4.2 L/yr |
Assistant Manager
281
salaries
| ₹4 L/yr - ₹16 L/yr |
Flipkart
Indiamart Intermesh
Udaan
BigBasket