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
You have been given an integer array/list 'ARR' of size 'N'. Write a solution to check if it could become non-decreasing by modifying at most 1 element.
We define an ...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 5 more amswers
Q2. Sort Linked List
You are given a Singly Linked List of integers which is sorted based on absolute value.
You have to sort the Linked List based on actual values.
The absolute value of a real number x,...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
View 3 more amswers
Q3. Diameter Of Binary Tree
You are given a Binary Tree. You are supposed to return the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path between any two end...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
View 3 more amswers

Round duration - N/A
Round difficulty - Medium

Q1. Assignment
You are given a webpage design and you have to code the same using html, CSS, core Js
Ans. 
The candidate is asked to code a given webpage design using HTML, CSS, and core JavaScript.
• Understand the webpage design thoroughly before starting the coding process.

• Use HTML to structure the content of the webpage.

• Apply CSS to style the webpage according to the design.

• Utilize core JavaScript to add interactivity and functionality to the webpage.

• Ensure cross-browser compatibility and responsiveness of the webpage.

• Test...read more
Answered by AI
View 1 more amswer

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
You have been given an integer array/list(ARR) of size N. Where N is equal to [2M + 1].
Now, in the given array/list, 'M' numbers are present twice and one number is present only once...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 3 more amswers

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.

Q1. Basic HR Questions
What are your expectations?
What keep you motivated?
Ans. 
My expectations are to work in a challenging and collaborative environment where I can continuously learn and grow. I am motivated by opportunities to solve complex problems and contribute to meaningful projects.
• Expect to work in a challenging and collaborative environment

• Desire to continuously learn and grow

• Motivated by opportunities to solve complex problems

• Driven by contributing to meaningful projects
Answered by AI
Add your answer

- 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
You are given a Singly Linked List of integers. You have to find if the given linked list is palindrome or not.
A List is a palindrome if it reads the same from the lef...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 by CodingNinjas
View 2 more amswers
Q2. Segregate Odd-Even
There is a wedding ceremony at NinjaLand. The bride and groom want everybody to play a game and thus, they have blindfolded the attendees. The people from the bride’s side are holding od...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 by CodingNinjas
View 1 more amswer

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.

Q1. Frontend Development Questions
Create a Stopwatch using HTML, CSS, and JS
Create an input form using HTML, CSS, and JS
Create some basic structure using HTML, CSS, and JS. I can't remember it but it was also ...read more
Add your answer

Round duration - 10080 Minutes
Round difficulty - Easy

Q1. Assignment
We were given a Figma link for a landing page of a website. We need to pixel-perfect that design.
Ans. 
Tip 1 : You MUST work with Figma first. Some of my friends never worked with Figma before and they couldn't even export the images properly. 
Tip 2 : Use the pixel-perfect extension from the chrome web store. 
Answered by CodingNinjas
Add your answer

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.

Q1. Designing Question
I was told to build a compound interest calculator where we need to store the previous calculation, ability to modify/delete them. There were 2 bonus features like store data in local sto...read more
Add your answer

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.

Q1. Technical Questions
Get the frogs and the lilypads line up in order (e.g. yellow lilypad is the first among all other lilypads and yellow frog is first among all other frogs) using flex-direction. 
Arra...read more
Add your answer

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.

Q1. Technical Questions
First, he asked me about different meta tags in HTML and different types of CSS media queries.
Then he asked me questions about Promise and async-await. I need to create a function that t...read more
Add your answer