MagicPin Front end Developer Interview Questions and Answers

Q1. SSR vs CSR question was asked?
Add your answer

My mostly question were around node js frame works and other tools

Q1. Case study for the question asked
Add your answer
Q2. Tell me something more about you
Add your answer

Question are very tough and faad

Question like trees linked list and graphs

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 - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

Q1. 
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...read more
Ans. 
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
• Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

• Use level-order input to construct the Binary Tree.

• Traverse the Binary Tree recursively to generate the required traversals.

• Ensure proper handling of null nodes represented by -1 in the input.

• Return the three traversals as
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

Q1. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal and update the intersection array.

• Return the intersection array as the result.
Answered by AI
Add your answer