BookMyShow Front end Developer Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Easy

1 coding question which was quite easy. Some MCQ that includes basic questions related to html, css, javascript, oops, dbms and output.

Q1. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.
• Implement a doubly linked list to keep track of the order of keys based on their recent usage.

• Use a hashmap to store key-value pairs for quick access and updates.

• When capacity is reached, evict the least recently used item before inserting a new one.

• Update the order of keys in the linked list whenever a ke
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

easy round. Had some frontend questions related to html ,css, js , etc Explain Closures in JavaScript. In how many ways can we specify the CSS styles for the HTML element?

Q1. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. 
Check if a given string is a palindrome considering only alphanumeric characters.
• Remove non-alphanumeric characters from the input string.

• Compare the string with its reverse to check for palindrome.

• Handle edge cases like empty string or single character input.

• Use two pointers approach for efficient comparison.
Answered by AI
Add your answer
Q2. DBMS Questions
normalization, indexing
Ans. 
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Indexing is a technique to quickly retrieve data from a database.
• Normalization helps in reducing data redundancy by breaking down tables into smaller, related tables.

• Indexing is used to quickly retrieve data by creating indexes on columns in a table.

• Normalization ensures data integrity by minimizing data dupli...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

late at 8.00 pm

Q1. 
Priority CPU Scheduling Problem
Given 'N' processes with their “burst times”, where the “arrival time” for all processes is ‘0’, and the ‘priority’ of each process, your task is to compute the “waiting ti...read more
Ans. 
Implement Priority CPU Scheduling algorithm to compute waiting time and turn-around time for processes.
• Implement a function that takes in burst times, priorities, and number of processes as input

• Sort the processes based on priority, with lower process ID as tiebreaker

• Calculate waiting time and turn-around time for each process based on the scheduling algorithm
Answered by AI
Add your answer
Q2. Can you explain the concept of data spooling in operating systems?
Ans. 
Data spooling is a process where data is temporarily stored in a buffer before being sent to an output device.
• Data spooling helps in managing the flow of data between different devices by storing it temporarily.

• It allows for efficient processing of data by decoupling the input/output operations.

• Examples of data spooling include print spooling, where print jobs are stored in a queue before being sent to the printer.
Answered by AI
Add your answer
Q3. What is the difference between inheritance and generalization in the context of database management systems?
Ans. 
Inheritance is a relationship between a superclass and subclass, while generalization is a relationship between entities with common characteristics.
• Inheritance involves a parent-child relationship where the child class inherits attributes and methods from the parent class.

• Generalization involves grouping entities with common attributes into a higher-level entity.

• Inheritance is a specific form of generalization in obje...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It comprised of general aptitude questions and two coding questions. It was an offline test.

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not attack each other.

• Generate and print valid configurations where queens are placed safely.

• Consider constraints and time limit for efficient solution.

• Exam...read more
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

• Iterate through the array and swap elements based on the values encountered.

• Achieve sorting in a single scan over the array without using any extra space.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

After having a technical discussion about my CV. He gave me two questions to code.

Q1. 
Ninja and Substrings Problem Statement
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...read more
Ans. 
Find all unique contiguous substrings of size two from a given string.
• Iterate through the string and extract substrings of size two

• Use a set to store unique substrings

• Return the set as an array of strings
Answered by AI
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

• If the two pointers meet at any point, there is a cycle in the linked list.

• If one of the pointers reaches the end of the list (null), there is no cycle.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code. 
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.

Q1. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Ans. 
Generate all possible combinations of balanced parentheses for a given number of pairs.
• Use recursion to generate all possible combinations of balanced parentheses.

• Keep track of the number of open and close parentheses used in each combination.

• Return the valid combinations as an array of strings.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

I applied thorough LinkedIn and got a call from HR for the interview.
I went to their Noida Office.
First round was mainly focused on Javascript fundamentals.
Interviewer was also friendly.

Round duration - 1 hour
Round difficulty - Medium

Second round was after 15 minutes of the first round. The focus of this round was DS & Algorithms.

Q1. 
Find Subarray with Given Sum
Given an array ARR of N integers and an integer S, determine if there exists a subarray (of positive length) within the given array such that the sum of its elements equals S....read more
Ans. 
Given an array and a target sum, find a subarray that sums up to the target sum.
• Iterate through the array while keeping track of the running sum and the starting index of the subarray.

• Use a hashmap to store the running sum and its corresponding index.

• If the running sum - target sum is found in the hashmap, it means a subarray with the target sum exists.

• Return the starting and ending indices of the subarray or [-1, -1]
Answered by AI
Add your answer
Q2. 
Minimum Number of Platforms Required
You are provided with two arrays, AT and DT, representing the arrival and departure times of all trains arriving at a railway station.
Your task is to determine the m...read more
Ans. 
This question asks to find the minimum number of platforms required at a railway station so that no train needs to wait.
• Sort the arrival and departure times arrays in ascending order.

• Initialize a variable 'platforms' to 1 and 'maxPlatforms' to 1.

• Iterate through the arrival and departure times arrays simultaneously.

• If the current arrival time is less than or equal to the current departure time, increment 'platforms'.

• If ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. What JavaScript questions did he ask you during the managerial round, and can you describe the work culture of his team?
Ans. 
The interviewer asked about JavaScript questions and the work culture of the team during the managerial round.
• JavaScript questions related to closures, prototypes, event handling, and asynchronous programming may have been asked.

• Work culture may involve collaboration, innovation, agile methodologies, and continuous learning.

• Examples of work culture could include regular team meetings, code reviews, hackathons, and ment
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

Consists of 5 questions of DSA
1 Knapsack, 1 bitwise, 1 string , 1 basic mathematics, 1 dynamic programming

Q1. Based on Coding question and dbms and question based on resume.
Add your answer

Q1. Recursive approach for printing prime number It was taken by CTO of company
Add your answer