Shopclues SDE Interview Questions and Answers

Leetcode medium question

Q1. Technical coding
Add your answer
Q2. Java basics questions were asked
Add your answer
Q3. Basics of Unix and shell scripting
Add your answer

Coding round has two questions ranging in medium -hard level leetcode questions

Q1. Doubly Linked List
Add your answer
Q2. Graph - topological sort
Add your answer
Q3. Operating system, database management system
Add your answer

Q1. Longest Common Subsequence
Ans. 
Longest Common Subsequence is the longest sequence of characters that appear in the same order in both strings.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of longest common subsequences.

• Iterate through the strings to fill the array and find the longest common subsequence.
Answered by AI
Add your answer
Q2. Largest area in histogram
Ans. 
The largest area in a histogram refers to the rectangle with the maximum area that can be formed within the histogram bars.
• Identify the largest rectangle that can be formed by considering each bar as a potential height and calculating the area based on the width of the rectangle.

• Use a stack data structure to efficiently find the largest area in a histogram by keeping track of the indices of the bars in non-decreasing o...read more
Answered by AI
Add your answer

There was only two coding questions in 50 minutes interview

Q1. One coding question
Add your answer
Q2. Only one coding question
Add your answer
Q3. Medium level coding question
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

Build the conference room

Q1. Asked all about my previous work.
Add your answer
Q2. Resume based question , went in depth.
Add your answer

Q1. Not much , discussed about the offer
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

GOOGLE DOCUMEENTS, 45 MIN, NUMPY

Q1. WHY YOU AS EMPLOYEE
Add your answer
Q2. WHY FLIPKART AS EMPLOYER
Add your answer

What is array, what is avl tree, what is b+ tree.

What is b+ tree, what is red black tree

Q1. What is your name
Add your answer

What is avl tree, what is b+ tree