Lenskart SDE Interview Questions and Answers

3 coding questions one on array

Q1. Leetcode problem called 01 island
Add your answer
Q2. Leetcode problem no of ilsands
Add your answer

Q1. Standard Leetcode Medium Problem.
Add your answer

It had 9 uqestions , one problem solving , one SQL , one API and 6 mcq

Easy assignment , if you hav eOOps knowledge you can do it

Aptitude test anddsa quuestions and also core questions

Dsa round tree and graph questions

Maths,dsa and core subject round

Dsa round graph and tree and ll

Q1. Two stack based question
Add your answer
Q2. Find the non repeting no from an array
Ans. 
Find the non-repeating number in an array of strings.
• Iterate through the array and count the occurrences of each number using a hashmap.

• Return the number that has a count of 1.
Answered by AI
Add your answer

Q1. SQL basics - joins, aggregates, groupby, where
Add your answer
Q2. Java - leetcode medium - string manipulation, swap two numbers, linked list
Add your answer

Machine coding round for an App engineer role.
Please have personal laptop setup properly

Q1. Algorithm questions such as DP
Add your answer
Q2. Algorithm with graph
Ans. 
One common algorithm with graphs is Dijkstra's algorithm for finding the shortest path.
• Dijkstra's algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.

• It works by maintaining a priority queue of nodes based on their distance from the starting node.

• The algorithm iteratively selects the node with the smallest distance, updates the distances of its neighbors, and repeats ...read more
Answered by AI
Add your answer

Q1. Hiring manager round. mostly based on past work
Add your answer
Q2. Design question
Add your answer