Lenskart Solutions logo

Lenskart Solutions Software Engineer Interview Questions
& Process

Real candidates share what happened, how many rounds they had,
and how the experience turned out.

Based on 35 interview experiences · FREE TO READ

2.6 Rounds average
Average Typical difficulty
48.6% Positive experience

Candidate interview experiences

First-hand accounts from people who interviewed at Lenskart Solutions.

Showing 3 of 35
Lenskart Solutions logo
Lenskart Solutions

Software Developer

Engineering · nearly a year ago

Mid Average Negative experience No offer 2 rounds
Interview process
Technical screen Recruiter call
Interview formats
Coding Technical Behavioral

It was a bit tough to get through and requires a solid understanding of coding fundamentals and design patterns. There was one technical round where we coded, and then an HR round. My interviewer was great, and we had a good discussion while coding.

Confirmed questions3 questions
  • Questions about strings.
  • Questions about arrays.
  • Questions about data structures and algorithms (DSA).
Lenskart Solutions logo
Lenskart Solutions

Software Developer

Engineering · more than a year ago

Senior Difficult Positive experience No offer 4 rounds
Interview process
Technical screen Onsite Onsite Onsite Technical screen Technical screen Technical screen Technical screen Technical screen Technical screen Technical screen Technical screen
Interview formats
Coding Technical System Design Behavioral

So the interview took about two weeks and had 4 rounds in total. It was a pretty good experience overall, even though I didn't get the job after the last round. Apparently, they were looking for someone absolutely perfect. The first round was all about coding questions and some Java core concepts. The second round was in person and focused mostly on tree-related problems. The third round was also in person, and we went into more advanced topics like caching, system design, design patterns, and of course, more tree questions. The final round was the managerial one, also in person. This one was heavily focused on system design, thinking about things like how to handle simultaneous updates in a Google Docs-like system and how to generate itemized bills for servers based on their usage.

Confirmed questions8 questions
  • Can you find the pair sum in a tree?
  • What is the LCA in a tree?
  • How to find the largest subarray with an equal number of 0s and 1s?
Lenskart Solutions logo
Lenskart Solutions

Software Engineer

Engineering

Entry Easy Negative experience No offer 2 rounds
Interview process
Technical screen Phone screen
Interview formats
Coding Technical

Applied via employee referral. The whole thing took 1 day at Lenskart Bangalore. The first round was a programming test on paper with about 15 snippet codes and 2 programs on arrays, plus designing a parking lot. After passing the first round, there was a second round. In the second round, the interviewer didn't seem to know Java or what questions to ask, he was looking at Google and asking questions. He asked a few basic questions on collections, threads, exception handling, and data structures. I answered everything correctly, but later they gave negative feedback. It was a waste of a full day with some clueless person interviewing me. If they don't want to select someone, they shouldn't waste their time calling them for an interview.

Confirmed questions7 questions
  • Can you write a program that uses Arrays?
  • Could you provide a program to count the leaves of a given binary tree?
  • How would you design a parking lot?

Lenskart Solutions Software Engineer Interview Questions

Quoted word for word from Lenskart Solutions interview reports.

Given an expression, check for valid parenthesis and return true or false.

Read reports

What is the difference between String and StringBuffer in Java?

Read reports

Find the row with the maximum number of 1s in a given row-wise sorted 2D array containing only 0s and 1s.

Read reports

Given a sequence of braces, determine if they are correctly ordered using a stack.

Read reports

Given a list containing only 0s and 1s, how would you rearrange it so that all the 0s appear before all the 1s?

Read report

How to find the largest subarray with an equal number of 0s and 1s?

Read report

Can you return the maximum sum of nodes found on any single level within a Binary Search Tree?

Read report

What is the algorithm to find the maximum sub array sequence?

Read report

Formats, difficulty and experience

Across all 35 Lenskart Solutions interview reports.

Interview formats

Technical 40.9%
Coding 34.4%
Behavioral 17.2%
System Design 7.5%

Interview difficulty

Easy 22.9%
Average 54.3%
Difficult 22.9%

Candidate experience

Negative 34.3%
Positive 48.6%
Neutral 17.1%