Evolution Infosystem interview experience Real time questions & tips from candidates to crack your interview
MERN Stack Developer
Evolution Infosystem
2 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Journey
I completed my MERN stack course and created a few projects using the MERN stack to gain practical experience. I secured this opportunity by connecting with HR on LinkedIn.
Application story
I applied through a LinkedIn post, and the HR contacted me. There were two rounds of interviews; the first one was a Gorilla test.
Why selected/rejected for the role?
I was rejected because I was unable to solve the DSA problems properly. There were three questions, but I only managed to solve one, which led to my rejection.
Preparation
Duration: 6 months
Topics: Computer Fundamentals, OOPS, React.js, JavaScript, Node.js, Express.js, MongoDB.
Tip 1: Build a project so you can explain it well in the interview.
Tip 2: Be consistent.
Application process
Where: Linkedin
Eligibility: Good resume, (Salary Package: 4LPA)
Tip 1: Make it ATS-friendly.
Tip 2: Add projects that you built.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration180 minutes
Interview date5 Sep 2024
Coding problem1
It included a total of 12 topics:
JavaScript, React.js, Node.js, Aptitude, Reasoning, Git, HTML, CSS, MongoDB, English Grammar,DSA, Express.js
1. Count Smaller or Equal elements in array
Moderate
25m average time
70% success
0/80
Asked in companies
You are given two arrays of integers. Let's call the first array A and the second array B. A finds the number of elements in array B that are smaller than or equal to that element for every array element.
For example:
A = [2, 3, 0] , B = [5, 1]
For the first index, A[0] = 2
In array B only 1 is less than 2. Therefore the answer for the first index is 1.
For the second index, A[1] = 3
In array B only 1 is less than 3. Therefore the answer for the second index is also 1.
For the third index, A[2] = 0
Both the elements of array B are greater than 0.
Therefore the answer for the third index is 0.
Hence, the final answer is [1,1,0] in this case.
Problem approach
Read the problem statement carefully.
02
Round
Easy
Online Coding Interview
Duration30 minutes
Interview date9 Sep 2024
Coding problem1
The interviewer was friendly.
1. Split Array
Moderate
0/80
Asked in companies
You are given an array ‘ARR’ of size ‘N’ and an integer ‘M’. You have to split the array into ‘M’ non-overlapping, non-empty subarrays such that the maximum of all the subarray’s sum is the minimum possible. Your task is to return the minimum of the maximum of all the subarray’s sum.
For example:
You are given ‘ARR’ = [7, 2, 6, 10, 8] and ‘M’ = 2. We split the array as [ 7, 2, 6] and [10, 8], the maximum of 7 + 2 + 6 and 10 + 8 is 18, which is the minimum possible.
Problem approach
The interviewer asked me to optimise the solution.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
961 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6451 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes