i
Lenskart
Filter interviews by
I was interviewed 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 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.
Design a 2/3rd Winning game.
The game should have a clear win condition
The win condition should be achievable in 2/3rd of the total game time
The game should have a balanced difficulty level
The game should have a clear feedback system for the player
Examples: Chess, Tic Tac Toe, Connect Four
NoSQL is non-relational and schema-less while SQL is relational and has a fixed schema.
NoSQL databases are horizontally scalable and can handle large amounts of unstructured data.
SQL databases are vertically scalable and are better suited for structured data with complex relationships.
NoSQL databases are often used in web applications, while SQL databases are commonly used in enterprise applications.
Examples of NoSQL d...
I was interviewed 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
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 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 applied via Company Website and was interviewed before Jun 2020. There were 3 interview rounds.
I applied via Referral and was interviewed in May 2017. There were 4 interview rounds.
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.
I applied via Naukri.com and was interviewed before Mar 2017. There were 4 interview rounds.
I am looking to establish a long-term career with the company and grow professionally.
I am committed to contributing to the company's success for the foreseeable future
I am eager to take on new challenges and responsibilities within the organization
I value stability and growth opportunities in my career
I applied via Campus Placement and was interviewed in May 2019. There was 1 interview round.
To sell a pen, highlight its unique features and benefits, and show how it can solve a customer's problem.
Ask the customer about their needs and how they use pens
Highlight the pen's unique features, such as a comfortable grip or smooth ink flow
Explain how the pen can solve the customer's problem, such as helping them write more neatly or quickly
Offer a demonstration of the pen's features and benefits
Create a sense of u...
Store Manager
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Optometrist
869
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
541
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Associate
330
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
255
salaries
| ₹0 L/yr - ₹0 L/yr |
Coolwinks Technologies
Specsmakers Opticians
Titan Eye Plus
GKB Opticals