Upload Button Icon Add office photos

Filter interviews by

Mad Street Den Front end Engineer Interview Questions and Answers

Updated 4 Nov 2024

Mad Street Den Front end Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Nov 2023. There were 5 interview rounds.

Round 1 - One-on-one 

(1 Question)

  • Q1. More focused on past experience
Round 2 - Assignment 

Drag and drop application in prefered language

Round 3 - Technical 

(2 Questions)

  • Q1. Technical discussion on past experience
  • Q2. DSA (leetcode easy)
Round 4 - Technical 

(1 Question)

  • Q1. VP discussion on scenario-based question to test dsa (recursion)
Round 5 - HR 

(1 Question)

  • Q1. Salary negotiation

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Assignment 

Create a hero section for website

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Basic array question
Round 2 - Technical 

(1 Question)

  • Q1. Find the first circular tour that visits all petrol pumps
  • Ans. 

    The first circular tour that visits all petrol pumps can be found using the concept of a circular linked list.

    • Create a circular linked list with each node representing a petrol pump

    • Calculate the difference between petrol available at each pump and the distance to the next pump

    • Start from a pump where the sum of differences is positive and traverse the circular linked list until completing the tour

  • Answered by AI

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Level order tree traversal
  • Q2. Find the pair element from the array
  • Ans. 

    Find the pair element from the array

    • Iterate through the array and use a hashmap to store elements and their counts

    • Check if the current element's complement exists in the hashmap

    • Return the pair if found, otherwise return null

  • Answered by AI

Skills evaluated in this interview

I applied via Company Website and was interviewed in Mar 2022. There were 2 interview rounds.

Round 1 - Technical 

(6 Questions)

  • Q1. What is bind in javascript and write its polyfill
  • Ans. 

    Bind creates a new function with a specified 'this' value and arguments.

    • Bind returns a new function with the same body as the original function.

    • The 'this' value of the new function is bound to the first argument passed to bind().

    • The subsequent arguments are passed as arguments to the new function.

    • Polyfill for bind() can be created using call() or apply() methods.

  • Answered by AI
  • Q2. Output questions related to hoisting and closures.
  • Q3. What is event bubbling, event capturing and its use?
  • Ans. 

    Event bubbling and event capturing are two mechanisms in JavaScript that describe the order in which events are handled.

    • Event bubbling is the process where an event is first captured by the innermost element and then propagated to its parent elements.

    • Event capturing is the opposite process where an event is first captured by the outermost element and then propagated to its child elements.

    • Event bubbling is the default b...

  • Answered by AI
  • Q4. What is the difference between async and defer
  • Ans. 

    async loads script while page continues to load, defer loads script after page has loaded

    • async loads scripts asynchronously while page continues to load

    • defer loads scripts after the page has loaded

    • async scripts may not execute in order, while defer scripts do

    • async scripts may cause rendering issues, while defer scripts do not

  • Answered by AI
  • Q5. Explain box model in css, and what is specificity in CSS. What are render-blocking statements?
  • Ans. 

    Box model defines how elements are rendered in CSS. Specificity determines which CSS rule applies to an element. Render-blocking statements delay page rendering.

    • Box model includes content, padding, border, and margin.

    • Specificity is calculated based on the number of selectors and their types.

    • Render-blocking statements are CSS or JavaScript files that prevent the page from rendering until they are loaded.

    • Use media querie...

  • Answered by AI
  • Q6. Tell about Saas( Syntactically Awesome Style Sheets)
  • Ans. 

    Saas is a CSS preprocessor that extends the functionality of CSS with variables, mixins, and more.

    • Saas stands for Syntactically Awesome Style Sheets

    • It allows for the use of variables, mixins, and functions in CSS

    • Saas code must be compiled into CSS before it can be used in a web page

    • Saas is often used in conjunction with build tools like Gulp or Webpack

  • Answered by AI
Round 2 - Technical 

(4 Questions)

  • Q1. Write code to find if two objects are equal or not in javascript
  • Ans. 

    Code to check equality of two objects in JavaScript

    • Use the JSON.stringify() method to convert the objects into strings

    • Compare the string representations of the objects using the === operator

    • If the strings are equal, the objects are considered equal

  • Answered by AI
  • Q2. Write a code to find if the input date is today or tomorrow based on the current date. If it's not today or tomorrow, output the no of days difference between the input date and the current date.
  • Ans. 

    Code to find if input date is today/tomorrow or no of days difference from current date.

    • Get current date using Date() constructor

    • Convert input date to Date object

    • Compare input date with current date to check if it's today/tomorrow

    • If not, calculate the difference in days using getTime() method

    • Output the result accordingly

  • Answered by AI
  • Q3. Some output questions based on promises.
  • Q4. How will you implement infinite scrolling in react js?
  • Ans. 

    Implement infinite scrolling in React JS using Intersection Observer API.

    • Use Intersection Observer API to detect when the user has scrolled to the bottom of the page.

    • Fetch new data and append it to the existing data using setState.

    • Use a loading spinner to indicate that new data is being fetched.

    • Add a debounce function to prevent multiple API calls while scrolling.

    • Use a key prop when rendering the list of data to avoid

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Snapdeal Front end Engineer interview:
  • Javascript
  • CSS
  • React.Js
Interview preparation tips for other job seekers - One has to be clear with Js fundamentals. and should have a good understanding of CSS & HTML concepts. Practice coding questions and some design questions.

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in May 2021. There were 4 interview rounds.

Interview Questionnaire 

10 Questions

  • Q1. First-round was an online test on hacker rank. There were 4 questions related to the array, string, and tree.
  • Q2. Create an immutable class.
  • Ans. 

    An immutable class is a class whose instances cannot be modified after creation.

    • Make all fields private and final

    • Don't provide any setter methods

    • Ensure that any mutable objects passed to the constructor are defensively copied

    • Make the class final so that it cannot be subclassed

  • Answered by AI
  • Q3. Create a Singelton pattern.
  • Ans. 

    Singleton pattern ensures only one instance of a class is created and provides a global point of access to it.

    • Create a private constructor to prevent direct instantiation of the class.

    • Create a private static instance of the class.

    • Create a public static method to access the instance, and create the instance if it doesn't exist.

    • Ensure thread safety by using synchronized keyword or double-checked locking.

  • Answered by AI
  • Q4. Difference between Vector and ArrayList.
  • Ans. 

    Vector is synchronized and ArrayList is not. Vector is thread-safe and ArrayList is not.

    • Vector is a legacy class and ArrayList is a part of the Java Collection Framework.

    • Vector is synchronized which means only one thread can access it at a time, while ArrayList is not.

    • Vector is thread-safe which means it can be used in a multi-threaded environment, while ArrayList is not.

    • Vector is slower than ArrayList because of synch...

  • Answered by AI
  • Q5. Create Linked List without using the internal library and provide the functionality of add delete find.
  • Ans. 

    Create Linked List without using internal library and provide add, delete, find functionality.

    • Create a Node class with data and next pointer

    • Create a LinkedList class with head pointer and methods to add, delete, and find nodes

    • Use a loop to traverse the list and perform operations

    • Handle edge cases such as adding to an empty list or deleting the head node

  • Answered by AI
  • Q6. One question was related to binary search.
  • Q7. Few more questions related to java.
  • Q8. The architecture of the current system.
  • Ans. 

    The current system follows a microservices architecture.

    • The system is divided into multiple independent services.

    • Each service has its own database and communicates with other services through APIs.

    • The architecture allows for scalability and flexibility.

    • Examples of microservices used in the system include user authentication, payment processing, and inventory management.

  • Answered by AI
  • Q9. Find the total no of the island in a 2d matrix. Working code was required.
  • Ans. 

    Find the total no of islands in a 2D matrix.

    • Use DFS or BFS to traverse the matrix.

    • Mark visited cells to avoid repetition.

    • Count the number of islands found.

  • Answered by AI
  • Q10. Find loop in a linked list.
  • Ans. 

    Loop detection in a linked list.

    • Use two pointers, one moving at twice the speed of the other.

    • If there is a loop, the faster pointer will eventually catch up to the slower one.

    • If there is no loop, the faster pointer will reach the end of the list.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Before the interview brush up on the Linked list, Tree, and array. This is a common interview problem asked in Snapdeal.

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. What do u want us to do fr u??
  • Ans. 

    I want you to provide me with challenging software development projects that will help me grow as a developer.

    • Challenging projects that will push my skills to the limit

    • Opportunities to learn new technologies and programming languages

    • Collaborative work environment with experienced developers

    • Clear communication and feedback on my work

    • Opportunities for career growth and advancement

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Pay me high!!
Tips: Never say something like that!!

Skill Tips: Develop codes
Skills: Programming
College Name: IIT BOMBAY

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

    • Return the index of the integer if found, else return -1.

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

  • Q1. 

    Print the Kth Digit

    Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).

    Input:

    The first line contains ...
  • Ans. 

    The task is to find the Kth digit from the right in the number obtained from N raised to the power M.

    • Iterate through the digits of N^M from right to left

    • Keep track of the position of the current digit

    • Return the digit at position K from the right

  • Answered by AI
  • Q2. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
  • Q3. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindrome with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

9 Questions

  • Q1. A sentence is given which contains lowercase English letters and spaces. It may contain multiple spaces. Get first letter of every word and return the result as a string. The result should not contain any ...
  • Q2. Find Nth largest element in the BST
  • Ans. 

    Find Nth largest element in the BST

    • Traverse the BST in reverse inorder and keep track of count

    • If count equals N, return the current node's value

    • If count exceeds N, stop traversing and return null

    • If count is less than N, continue traversing

  • Answered by AI
  • Q3. Given a BST, find the node which contains the value which is equal to or greater than the input value?
  • Ans. 

    Find node in BST with value equal to or greater than input value.

    • Start at root node

    • If input value is less than current node value, move to left child

    • If input value is greater than or equal to current node value, move to right child

    • Repeat until node with desired value is found or null is reached

  • Answered by AI
  • Q4. Write a program to check if a binary tree is balanced
  • Ans. 

    Program to check if a binary tree is balanced

    • Calculate height of left and right subtrees recursively

    • Check if the difference in height is not more than 1

    • Repeat for all nodes in the tree

    • Time complexity: O(nlogn) or O(n)

    • Space complexity: O(h) where h is the height of the tree

  • Answered by AI
  • Q5. Given s string, Find max size of a sub-string, in which no duplicate chars present?
  • Ans. 

    Find max size of a sub-string with no duplicate characters in a given string.

    • Use a sliding window approach with two pointers.

    • Maintain a hash set to keep track of unique characters.

    • Update the maximum length of the substring as you iterate through the string.

  • Answered by AI
  • Q6. What is a hash table? Explain how they work (hash function and buckets)?
  • Ans. 

    A hash table is a data structure that stores key-value pairs and uses a hash function to map keys to buckets.

    • Hash function takes a key and returns an index to a bucket

    • Collisions occur when multiple keys map to the same bucket

    • Collision resolution techniques include chaining and open addressing

    • Example: Dictionary in Python uses hash tables to store key-value pairs

  • Answered by AI
  • Q7. WAP to find a continuous subset whose sum is divisible by 7. We are given a array of number (-ve and +ve). calculate the complexity of your algorithm?
  • Ans. 

    WAP to find a continuous subset divisible by 7 from an array of numbers. Calculate algorithm complexity.

    • Iterate through the array and calculate the prefix sum modulo 7 at each index.

    • Store the prefix sum modulo 7 in a hash table with the index as the value.

    • If a prefix sum modulo 7 is already in the hash table, the subarray between the two indices has a sum divisible by 7.

    • Time complexity is O(n) and space complexity is O

  • Answered by AI
  • Q8. Given a 2-dimensional array of integers, find the value 1 in the array, and set all those rows, and columns to 1, which contains one of the values as 1
  • Ans. 

    Given a 2D array of integers, set rows and columns to 1 if they contain 1.

    • Iterate through the array to find the index of 1

    • Use two arrays to keep track of rows and columns with 1

    • Iterate through the rows and columns arrays to set values to 1

  • Answered by AI
  • Q9. How to find a number in a rotated sorted array. He was looking for the binary search kind of solution?

Interview Preparation Tips

General Tips: Flipkart Interview Process :-Telephonic Round : 1F2F : 3 Rounds
Skills: Data structure, Algorithm
College Name: NA

Skills evaluated in this interview

Mad Street Den Interview FAQs

How many rounds are there in Mad Street Den Front end Engineer interview?
Mad Street Den interview process usually has 5 rounds. The most common rounds in the Mad Street Den interview process are Technical, One-on-one Round and Assignment.
How to prepare for Mad Street Den Front end Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Mad Street Den. The most common topics and skills that interviewers at Mad Street Den expect are Artificial Intelligence, CSS, CSS3, Deployment and Django.
What are the top questions asked in Mad Street Den Front end Engineer interview?

Some of the top questions asked at the Mad Street Den Front end Engineer interview -

  1. VP discussion on scenario-based question to test dsa (recursi...read more
  2. DSA (leetcode ea...read more

Tell us how to improve this page.

Mad Street Den Front end Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Flipkart Interview Questions
4.0
 • 1.3k Interviews
Paytm Interview Questions
3.3
 • 752 Interviews
Myntra Interview Questions
4.0
 • 214 Interviews
Snapdeal Interview Questions
3.8
 • 75 Interviews
Shopclues Interview Questions
3.9
 • 9 Interviews
LimeRoad Interview Questions
2.6
 • 9 Interviews
GrapplTech Interview Questions
4.8
 • 9 Interviews
View all
Graphic Designer
53 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Graphic Designer
16 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Machine Learning Engineer
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Image Editor
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Analyst
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Mad Street Den with

Myntra

4.0
Compare

Flipkart

4.0
Compare

Paytm

3.3
Compare

Snapdeal

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