i
Mantra Labs
Filter interviews by
Clear (1)
Top trending discussions
I was interviewed before Dec 2020.
Round duration - 360 minutes
Round difficulty - Medium
Basically TCS conduct its flagship event named as CODEVITA . And it offers Internship to prefinal (3rd )year students .
Given an array of integers arr
, where arr[i]
represents the number of pages in the i-th
book, and an integer m
representing the number of students, allocate all the books ...
Allocate books to students in a way that minimizes the maximum number of pages assigned to a student.
Iterate through possible allocations and calculate the maximum pages assigned to a student.
Find the minimum of these maximums to get the optimal allocation.
Return the minimum pages allocated in each test case, or -1 if not possible.
Tip 1 : Good understanding of Data Structure and Algorithms
Tip 2 : Be clear in your Core Subjects.
Tip 3 : Do at least 1 good Project .
Tip 4 : Be humble and speak truth .
Tip 1 : Simple and Crisp .
Tip 2 : Do host your project and mention the link in the resume .
Tip 3 : Single Page
posted on 31 Mar 2023
I applied via Company Website and was interviewed before Mar 2022. There were 3 interview rounds.
An online open assisment is given and it has around 50 MCQs that need to be done in 50 mins
An assignmnet is given that need to be done in 7 days
posted on 19 May 2022
I was interviewed in Jul 2021.
Round duration - 180 Minutes
Round difficulty - Medium
General Questions Like - Introduction & How all the round have gone so far
Round duration - 90 Minutes
Round difficulty - Medium
One-to-One Interview based on DSA and Front-End Technologies including HTML, CSS & JS.
You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.
Remove duplicates from an array of integers while maintaining order.
Iterate through the array and add elements to a new array if they are not already present
Use a hash set to keep track of unique elements
Return the new array with unique elements in the same order as the original array
Round duration - 90 Minutes
Round difficulty - Hard
One-to-One Interview based on Front-End Technologies including HTML, CSS & JS.
In the last 10-20 minutes, some behavioral questions were asked:
1 How would you grade yourself in the interview so far?
2. You are present in a team and you have to convince your team members & client that your approach is better than the other team members.
3. You are the team leader & you have to point out & convey the negative points of a member of your team without getting him/her hurt.
- At last, they asked me if I have questions for them( I asked 2 questions ) & then the interview ended.
Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.
Merge K sorted arrays into a single sorted array.
Create a min heap to store the first element of each array along with the array index.
Pop the top element from the heap, add it to the result array, and push the next element from the same array back to the heap.
Repeat the process until all elements are processed.
Time complexity: O(N log K) where N is the total number of elements and K is the number of arrays.
Tip 1 : Make at least 1 full-stack project from scratch.
Tip 2 : Understand each & every concept & topic in depth.
Tip 1 : Make it authentic.
Tip 2 : Sync your resume with company JD.
posted on 29 May 2022
I was interviewed in May 2022.
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
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...
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 ...
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...
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
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 ...
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 ...
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.
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...
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.
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.
Tip 1 : Have your basics storing rather than focusing on react or any other similar frameworks
Tip 2 : Practice DOM manipulation using JS as in the assignment round you'll have to code an assignment with your screen shared
Tip 3 : Practice advance JS concepts like prototyping, promises, etc.
Tip 4 : Study your projects thoroughly, what tech you used where and why
Tip 5 : Don't think that if you are unable to answer some output based questions or to code some question so you will not get selected. I myself have multiple wrong answers to tricky js output based questions but then the interviewer asks you to execute the question and explain why this has happened. If you are able to explain the correct reason for the answer you are good to go.
Tip 1 : Mention your best projects along with Tech stack used so the interviewer can see what all tech stack you have worked on
Tip 2 : Do not put false things on resume, as the interviewer will definitely ask cross questions and you will get tricked.
Tip 3 : Don't worry about the resume too much, you are the main focus of the interview and not the resume.
posted on 7 Mar 2024
I applied via Campus Placement and was interviewed before Mar 2023. There were 5 interview rounds.
- 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.
posted on 20 Oct 2021
I was interviewed in Aug 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This was the DSA questions round. There were 2 questions. and both were basic questions.
Given a singly linked list of integers, determine if the linked list is a palindrome.
A linked list is considered a palindrome if it reads the same forwar...
Check if a given singly linked list of integers is a palindrome or not.
Create a function to reverse the linked list.
Use two pointers to find the middle of the linked list.
Compare the first half of the linked list with the reversed second half to determine if it's a palindrome.
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...
Rearrange a linked list such that odd numbers appear before even numbers while preserving the order.
Create two separate linked lists for odd and even numbers
Traverse the original list and append nodes to respective odd/even lists
Combine the odd and even lists while maintaining the order
Return the rearranged linked list
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.
Tip 1 : You will need to know advanced HTML and CSS which are used in real life like meta tags in HTML and media queries in CSS.
Tip 2 : You will need practical knowledge of js functions like map, filter, reduce apart from basic that we can use map in react to render lists.
Tip 3 : Learning some advanced concepts like debouncing, throttling, call, bind, etc will be helpful.
Tip 1 : Prepare for every word that you wrote in your resume,
Tip 2 : HR will ask about your projects and you should always have a good story for each project like why you create this project. This will really score some points in the interview.
posted on 17 Aug 2021
I applied via Campus Placement and was interviewed in Jul 2021. There were 5 interview rounds.
posted on 22 May 2024
They have their own platform
Take home assignment
posted on 23 Aug 2024
I applied via Approached by Company and was interviewed in Feb 2024. There were 3 interview rounds.
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
based on 1 review
Rating in categories
Software Engineer
175
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
97
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
UI/UX Designer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech