Mantra Labs Front end Developer Interview Questions and Answers

Q1. Pointer i c++ and css
Add your answer

Dsa round with medium tto hard level questions

They have their own platform

Take home assignment

Q1. Live coding round of CRUD based small app.
Add your answer

Q1. More on HTML, CSS, JS
Add your answer

Q1. Promises, async/await, settimeout etc.
Add your answer

I was asked 60 question with various snppits or problems to be solved within a time frame of 1 hour

3 dsa 2 medium 1 hard

To create a project in which i was asked to simply create a exact same page as given in design

Round duration - 90 Minutes
Round difficulty - Easy

You are given three ds coding questions which you have to solve within 90 mins.
The questions are easy to medium level for this round

Q1. 
Non-Decreasing Array Problem Statement
Given an integer array ARR of size N, determine if it can be transformed into a non-decreasing array by modifying at most one element.
An array is defined as non-de...read more
Ans. 
The solution checks if an integer array can become non-decreasing by modifying at most one element.
• Iterate through the array and check if there are more than one decreasing pairs of elements.

• If there are more than one decreasing pairs, return false.

• If there is only one decreasing pair, check if modifying one of the elements can make the array non-decreasing.

• If modifying the element at index i-1 or i can make the array ...read more
Answered by AI
View 2 more answers
Q2. 
Sort Linked List Based on Actual Values
You are given a Singly Linked List of integers that is initially sorted according to the absolute values of its elements. Your task is to sort this Linked List base...read more
Ans. 
The task is to sort a singly linked list based on actual values instead of absolute values.
• Traverse the linked list and store the values in an array

• Sort the array using any sorting algorithm

• Create a new linked list using the sorted array

• Return the new linked list
Answered by AI
Add your answer
Q3. 
Diameter of a Binary Tree Problem Statement
Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...read more
Ans. 
The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.
• The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.

• To find the diameter of a binary tree, we can use a recursive approach. We calculate ...read more
Answered by AI
Add your answer

Round duration - N/A
Round difficulty - Medium

Round duration - 120 Minutes
Round difficulty - Hard

This round focus on advanced Js concepts and the tech stack I used in my projects.

Q1. 
Find Unique Element in Array
You have been provided an integer array/list ARR of size N. Here, N is equivalent to 2M + 1 where each test case has M numbers appearing twice and one number appearing exactly...read more
Ans. 
The task is to find the unique number in an array where all other numbers occur twice.
• The array size is given by N = 2M + 1, where M is the number of elements occurring twice.

• Loop through the array and use a hashmap to count the occurrences of each number.

• Return the number with a count of 1, as it is the unique number.
Answered by AI
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Easy

It was a late night round as i have already had the previous 3 rounds at the same day. The HR asked about my experience regarding the previous rounds and also some situation based questions.

- They use their own platform for interviews, and assessments.
- There were html, css, js based questions in the coding round.
- Some questions were theoretical too.
- They tested nearly all major parts of js including let, const, arrays, promise, async, await, events, lexical scope, etc.

Q1. It was an online machine coding round, where you have to build something they ask in 1hr using html, css, js (vanilla).
Add your answer

Q1. Focused on html, css, and js (basic)
Add your answer

Q1. Focus majorly on JS some quick demonstration, advanced concepts like closures, async nature of js, etc
Add your answer

Q1. Behavioral round
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was the DSA questions round. There were 2 questions. and both were basic questions.

Q1. 
Check If Linked List Is Palindrome
Given a singly linked list of integers, determine if the linked list is a palindrome.
Explanation:
A linked list is considered a palindrome if it reads the same forwar...read more
Ans. Using Stack
The idea is to store the list values in a stack and then compare the values in the list with the values in the stack.
 
Algorithm:
1. Traverse the list from head to tail and push every node in the stack.
2. Make a pointer ‘cur’ which initially points to the head node.
3. If value at ‘cur’ is not equal to the top element of the stack, then the given list is not a palindrome
4. Else, move the ‘cur’ pointer to its next node...read more
Answered Anonymously
Add your answer
Q2. 
Segregate Odd-Even Problem Statement
In a wedding ceremony at NinjaLand, attendees are blindfolded. People from the bride’s side hold odd numbers, while people from the groom’s side hold even numbers. For...read more
Ans. Iterative Approach 1
As we have to arrange the nodes such that all the odd nodes should come before all the even nodes, we can move all the even valued nodes from their current positions to the end of the linked list. 
 
Algorithm:
 
• Initialise a pointer ‘LAST_NODE’ by NULL.
• Traverse the linked list to the end and get the last node of the list which will be pointed by ‘LAST_NODE’.
• Initialize a pointer ‘NEW_END’...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

This was a subjective round where we have to code HTML, CSS, and JS. We were not allowed to use any external editor and their editor was just plain notepad so we couldn't even see the output but still, we completed it. Everyone at my college passed this round.

Round duration - 10080 Minutes
Round difficulty - Easy

Round duration - 120 Minutes
Round difficulty - Medium

In this round, the interviewer asked me to turn on screen mirroring. And then he gave me 1 more design which I needed to create in front of him in the next 2 hours. In the previous round, the focus was on HTML and CSS but in this round, the major focus was on JS. You are allowed to use google but not copy-paste the whole code.

Round duration - 90 Minutes
Round difficulty - Hard

This was an online interview with one of their employees. My interview was taken by their front-end lead. She was very helpful during the interview. You are allowed to search for documentation.

Round duration - 90 Minutes
Round difficulty - Easy

This was also a front-end interview round. The interviewer was again very helpful and I was allowed to google.