Upload Button Icon Add office photos

Filter interviews by

Mad Street Den Backend Developer Interview Questions and Answers

Updated 8 Jun 2024

Mad Street Den Backend Developer Interview Experiences

1 interview found

Backend Developer Interview Questions & Answers

user image Kamalesh Kavin

posted on 8 Jun 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Basic aptitude. and some sql and coding

Round 2 - Coding Test 

Coding basic , some leetcode. some db ques

Round 3 - Coding Test 

Some coding, some db some leetcode

Interview Preparation Tips

Interview preparation tips for other job seekers - do good

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Approached by Company and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Group Discussion 

Because it is the one of best way fearness solution and understand the questions top speak 1st in bold.

Round 2 - Technical 

(2 Questions)

  • Q1. Detail question of Python to explain?
  • Q2. Detail explain of mysql?
  • Ans. 

    MySQL is a popular open-source relational database management system.

    • MySQL is used for storing and managing data in a structured format.

    • It supports SQL for querying and manipulating data.

    • MySQL is known for its speed, reliability, and ease of use.

    • It can be integrated with various programming languages like PHP, Python, Java, etc.

    • Examples of MySQL commands include SELECT, INSERT, UPDATE, DELETE.

  • Answered by AI

Skills evaluated in this interview

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

I applied via Indeed and was interviewed in Mar 2023. There were 4 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 

Create crud operation using angular,nodejs,mysql

Round 3 - Technical 

(1 Question)

  • Q1. Coding question base on previous programing experience
Round 4 - HR 

(1 Question)

  • Q1. Final round asked about previous experience
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Dec 2022. 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 - Technical 

(1 Question)

  • Q1. 1)what is async and await.
  • Ans. 

    Async and await are keywords used in asynchronous programming in JavaScript.

    • Async is used to define a function that returns a promise.

    • Await is used to pause the execution of a function until a promise is resolved.

    • Async/await makes asynchronous code look and behave like synchronous code.

    • Example: async function getData() { const response = await fetch('https://example.com/data'); return response.json(); }

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. 1)why nodejs is more popular
  • Ans. 

    Node.js is popular due to its event-driven, non-blocking I/O model and ability to handle large amounts of data.

    • Node.js allows for faster and more efficient development due to its use of JavaScript on both the front-end and back-end.

    • Node.js has a large and active community, with many open-source libraries and modules available.

    • Node.js is scalable and can handle high traffic and large amounts of data, making it a popular...

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Myrsa Technology Solutions Backend Developer interview:
  • nodejs
  • Typescript
Interview preparation tips for other job seekers - we should know the knowledge typescript and sql query is mandatory

Skills evaluated in this interview

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

I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Online coding test on hacker rank

Round 2 - Technical 

(1 Question)

  • Q1. Normal DSA question related to array & strings
Round 3 - Technical 

(1 Question)

  • Q1. Medium Level DSA questions form Linked list & Aarrays
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Coding Test 

-----.geeksforgeeks.org/replace-every-element-with-the-greatest-on-right-side/amp/



-----/

Interview Preparation Tips

Topics to prepare for Paytm Backend Developer interview:
  • DSA
  • Core java
  • Design Patterns
  • Spring Boot
Interview preparation tips for other job seekers - DSA , Design Patters , Core Java Concepts , Springboot
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Java threads concepts and its usage
  • Q2. Data structures problems and design quentions

I applied via LinkedIn and was interviewed in Apr 2021. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. 1. Mininum cost to reach the last cell of a 2D matrix. Required moves are only downward or to the right direction
  • Ans. 

    Minimum cost to reach last cell of 2D matrix with only downward or right moves.

    • Use dynamic programming approach to solve the problem.

    • Calculate minimum cost for each cell by considering minimum cost of its adjacent cells.

    • Final answer will be the minimum cost to reach the last cell.

  • Answered by AI
  • Q2. Design a Stack that can support getMin functionality. Whenever it calls getMin on stack it should return the min element in the stack.
  • Ans. 

    Design a stack that supports getMin functionality to return the minimum element in the stack.

    • Create two stacks, one for storing the actual elements and another for storing the minimum elements.

    • Push elements onto both stacks simultaneously.

    • When popping an element, pop from both stacks.

    • To get the minimum element, peek at the top of the minimum stack.

  • Answered by AI
  • Q3. Design a TreeSet functionality
  • Ans. 

    TreeSet is a data structure that stores unique elements in sorted order.

    • TreeSet is implemented using a Red-Black tree

    • It provides O(log n) time complexity for basic operations like add, remove, and contains

    • It also provides methods like first(), last(), headSet(), tailSet(), and subSet()

    • TreeSet can be used to implement priority queues and sorting algorithms

  • Answered by AI
  • Q4. Design a ArrayList that supprorts all the existing funtions of a list plus getMax functionality also.
  • Ans. 

    Design an ArrayList with getMax functionality.

    • Create a custom ArrayList class that extends the existing ArrayList class.

    • Add a getMax() method that returns the maximum value in the list.

    • Override the add() method to keep track of the maximum value in the list.

    • Update the maximum value whenever an element is added or removed from the list.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice Data Structures and algorithms. If you have industry experience you will be asked system design questions as well, migh as well prepare for that

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - HR 

(1 Question)

  • Q1. Human resources is tha set of people who make up the workforce of an organisation, business sector, industry.
Round 2 - Technical 

(2 Questions)

  • Q1. Connected with the partical use of machines, etc. in science and industry
  • Q2. Connected with the skills involved in a particular activity or subject

Interview Preparation Tips

Interview preparation tips for other job seekers - It was great here☺️

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

Mad Street Den Interview FAQs

How many rounds are there in Mad Street Den Backend Developer interview?
Mad Street Den interview process usually has 3 rounds. The most common rounds in the Mad Street Den interview process are Coding Test and Aptitude Test.

Tell us how to improve this page.

Mad Street Den Backend Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Mad Street Den Backend Developer Salary
based on 4 salaries
₹10 L/yr - ₹17 L/yr
40% more than the average Backend Developer Salary in India
View more details

Mad Street Den Backend Developer Reviews and Ratings

based on 1 review

3.0/5

Rating in categories

3.0

Skill development

3.0

Work-life balance

3.0

Salary

1.0

Job security

3.0

Company culture

3.0

Promotions

3.0

Work satisfaction

Explore 1 Review and Rating
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