Premium Employer

i

This company page is being actively managed by Lenskart Team. If you also belong to the team, you can get access from here

Lenskart Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Lenskart SDE-2 Interview Questions and Answers

Updated 27 May 2022

Lenskart SDE-2 Interview Experiences

1 interview found

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 27 May 2022

I appeared for an interview in Mar 2022.

Round 1 - Video Call 

(1 Question)

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

  • Q1. 

    Unique Element In Sorted Array

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Low-level system design round. 
Expected to come up with a running code.

  • Q1. 

    LRU Cache Implementation Problem

    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...
  • Ans. 

    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...

  • Answered by AI
Round 3 - HR 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

Standard behavioural questions by HR

  • Q1. Can you describe your past work experiences and projects from your previous company?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in GurgaonEligibility criteriaAbove 1 years of experienceLenskart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

SDE-2 Interview Questions & Answers

Uber user image Anonymous

posted on 15 Sep 2021

I appeared for an interview before Sep 2020.

Round 1 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

It was a telephonic interview at 10 in the morning. Interviewer seemed cool.

  • Q1. 

    Best Insert Position for a Target in a Sorted Array

    You are provided with a sorted array A of length N consisting of distinct integers and a target integer M. Your task is to determine the position where ...

  • Ans. 

    Find the best insert position for a target in a sorted array to maintain order.

    • Use binary search to find the correct position for the target integer in the sorted array.

    • If the target is already present in the array, return its index.

    • Maintain the sorted order of the array after inserting the target integer.

    • Handle edge cases like empty array or target being smaller than the first element or larger than the last element.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interview was in the morning at 10 AM in the office meeting room.

  • Q1. 

    House Robber Problem Statement

    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 ...

  • Ans. 

    House Robber problem - find maximum amount of money Mr. X can rob without triggering alarm in circular street.

    • Use dynamic programming to keep track of maximum money robbed at each house.

    • Consider two cases - robbing the first house and not robbing the first house.

    • Handle circular arrangement by considering the first and last houses separately.

    • Return the maximum amount of money that can be robbed without triggering the al

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 11 AM in the meeting office.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Calculate and print the median after each new integer is added to the stream.

    • Use a min heap to store the larger half of the numbers and a max heap to store the smaller half of the numbers.

    • Keep the two heaps balanced by ensuring the size difference is at most 1.

    • If the total number of elements is odd, the median is the top element of the larger heap. If even, it's the average of the tops of both heaps.

  • Answered by AI
Round 4 - Face to Face 

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 1 AM.

Round 5 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

The meeting was at 2 PM in the office meeting room.

Round 6 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

10 AM

  • Q1. Can you provide a deeper discussion about all the projects you completed in your previous company?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in HyderabadEligibility criteriaNoUber interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Graphs, Dynamic programming, Trees, stack, queue, System DesignTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be consistent in the preparation. Practice atleast one question everyday
Tip 2 : Make relevant notes that you can go through on the day before the interview
Tip 3 :Try to note your progress by giving timed contests

Application resume tips for other job seekers

Tip 1 : Clearly mention the details of the projects that are relevant to the company that you are applying for
Tip 2 : Ensure that there are no grammatical mistakes and that you have highlighted the important keywords in your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1. 

    Snake and Ladder Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1.  Stack using queue

    Mvvm architecture

  • Ans. 

    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

  • Answered by AI
Round 3 - HR 

Round duration - 1hour
Round difficulty - Easy

Interview Preparation Tips

Eligibility criteriaNo year gapBig Basket interview preparation:Topics to prepare for the interview - Core Java, android topics , Hacker coding test , ecommerce domain knowledge, data structure , algorithmsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : be confident
Tip 2 : always say truth about your experience
Tip 3 : don't be nervous

Application resume tips for other job seekers

Tip 1 : mentioned project u worked on 
Tip 2 : technical skills

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Uber user image Anonymous

posted on 15 Sep 2021

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Timing: evening
Environment: Online round took at home

  • Q1. 

    Smallest Subarray with K Distinct Elements Problem

    Given an array A consisting of N integers, find the smallest subarray of A that contains exactly K distinct integers.

    Input:

    The first line contains tw...
  • Ans. 

    Find the smallest subarray with exactly K distinct integers in an array.

    • Use a sliding window approach to keep track of the subarray with K distinct integers.

    • Use a hashmap to store the frequency of each integer in the current window.

    • Update the window size based on the number of distinct integers found.

    • Keep track of the smallest subarray meeting the criteria.

    • Return the starting and ending indices of the smallest subarray

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Medium

Machine coding round

Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Rat In a Maze Problem Statement

    Given a N * N maze with a rat placed at position MAZE[0][0], find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]. The rat is allowed to...

  • Ans. 

    The problem involves finding all possible paths for a rat to reach its destination in a maze.

    • Use backtracking to explore all possible paths in the maze.

    • Mark visited cells to avoid revisiting them.

    • Return the path once the destination is reached.

    • Handle edge cases like blocked cells and out-of-bounds movements.

  • Answered by AI
Round 4 - Face to Face 

Round duration - 60-90 minutes
Round difficulty - Medium

Round 5 - HR 

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager round

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNone as such. Only eligible criteria for SDE-2 role is that one should have prior experience working as SDEUber interview preparation:Topics to prepare for the interview - Data structures and algorithms, Design patterns, System design, DatabasesTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Do some basic research about the interview process and types of rounds while appearing for a company interview. Narrow down the topics and draft a realistic plan afterwards.
Tip 2 : Try to solve as many problems as possible as this is primarily what you will be doing in live interview rounds.

Application resume tips for other job seekers

Tip 1 : Tailor your resume as per expectations from the role you are applying for.
Tip 2 : Order your experiences and skills by relevance.
Tip 3 : Try to fit the content in a single page.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question

Round 3 - Assignment 

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.

Round 4 - One-on-one 

(4 Questions)

  • Q1. Basic discussion around the project & past experience.
  • Q2. Design a 2/3rd Winning game.
  • Ans. 

    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

  • Answered by AI
  • Q3. Discussion around how would you scale a application.
  • Q4. NoSQL vs SQL difference
  • Ans. 

    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...

  • Answered by AI
Round 5 - One-on-one 

(3 Questions)

  • Q1. Hiring Manager round
  • Q2. Basic discussions around past work, past processes, what are your future aspirations etc.
  • Q3. This round was mainly for seeing the culture fitment of a candidate.

Interview Preparation Tips

Topics to prepare for Flipkart SDE-2 interview:
  • Data Structures
  • Algorithms
  • System Design
  • Microservices
  • Java
  • Spring Boot
Interview preparation tips for other job seekers - Prepare well for Data structures & Algorithms.
Along with that, you should be well-versed in System design concepts.

Skills evaluated in this interview

I appeared for an interview in May 2021.

Round 1 - Coding Test 

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 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

timing noon 3-4Pm
good interviewer 
interviwer was giving hints if required and all

  • Q1. 

    Problem: Sort an Array of 0s, 1s, and 2s

    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.

    Input:

    The input sta...
  • Ans. 

    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].

  • Answered by AI
  • Q2. 

    Maximum Path Sum Problem Statement

    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.

    Example:

    Input:
    For the giv...
  • Ans. 

    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...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Easy

evening 4-5:30PM
interviewer was good
very supportive and giving hints

  • Q1. Design a system for BookMyShow to allow users to book movie tickets.
  • Ans. 

    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

  • Answered by AI
Round 4 - HR 

(2 Questions)

Round duration - 40 Minutes
Round difficulty - Easy

4-5 PM
Interviewer was good

  • Q1. Why should we hire you?
  • Q2. Why are you considering a switch in your job?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriano criteriaFlipkart interview preparation:Topics to prepare for the interview - Data Structures, DBMS, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Practice Atleast 200 Questions
Tip 2 : Practice company specific interview question
Tip 3 : Prepare resume nicely

Application resume tips for other job seekers

Tip 1 : Prepare resume very nicely.
Tip 2 : don't mention any tech stack you are confident of.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Not Selected

I applied via Referral and was interviewed in Jan 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Assignment 

This was a machine coding round in which we have to implement an online cab booking service.

Round 3 - Coding Test 

Standard problem solving round consists of two questions on tree and dp.

Interview Preparation Tips

Interview preparation tips for other job seekers - 1.Do not take input as given,focus on implementing the services first.Take comma separated input also.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Coding Test 

That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.

Interview Questionnaire 

2 Questions

  • Q1. What is just dial
  • Ans. 

    Just Dial is an Indian search engine and local business directory that provides information about businesses and services in various cities across India.

    • Just Dial allows users to search for businesses and services based on their location and category.

    • It provides contact information, user reviews, ratings, and photos of the businesses listed.

    • Just Dial also offers advertising services to businesses to promote their servi...

  • Answered by AI
  • Q2. Just dial is the marketing platform

Skills evaluated in this interview

I applied via Walk-in and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1.  related to your business you asked questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview the ability of a person to be recognized by person quality human nature.

Tell us how to improve this page.

Join Lenskart Do More, Be More

Interview Questions from Similar Companies

Flipkart Interview Questions
3.9
 • 1.4k Interviews
Swiggy Interview Questions
3.8
 • 434 Interviews
BigBasket Interview Questions
3.9
 • 362 Interviews
CARS24 Interview Questions
3.5
 • 337 Interviews
Udaan Interview Questions
3.9
 • 334 Interviews
JustDial Interview Questions
3.5
 • 330 Interviews
Info Edge Interview Questions
3.9
 • 323 Interviews
Square Yards Interview Questions
3.7
 • 201 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
View all
Lenskart SDE-2 Salary
based on 4 salaries
₹12 L/yr - ₹22.3 L/yr
52% less than the average SDE-2 Salary in India
View more details
Store Manager
981 salaries
unlock blur

₹2.5 L/yr - ₹6 L/yr

Optometrist
869 salaries
unlock blur

₹2 L/yr - ₹5.2 L/yr

Sales Executive
558 salaries
unlock blur

₹1.2 L/yr - ₹4.5 L/yr

Sales Associate
345 salaries
unlock blur

₹1.5 L/yr - ₹4.2 L/yr

Assistant Manager
281 salaries
unlock blur

₹4 L/yr - ₹15.5 L/yr

Explore more salaries
Compare Lenskart with

Flipkart

3.9
Compare

Swiggy

3.8
Compare

Indiamart Intermesh

3.6
Compare

BigBasket

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview