Mission Mind IT Services interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Mission Mind IT Services

1 rounds | 3 Coding problems

Anonymous

Fresher | Apr 2021

Rejected

Interview preparation journey

Journey

During my B Tech, I started practising coding questions and participating in interview mocks.Till then, I solved many questions in all the practicing websites.

Application story

This company visited to my campus for the placement. We just had to upload resume and filled all details in the form.

Why selected/rejected for the role?

I was rejected because I was not able to give optimised approaches to the DSA questions that were asked to me. Hence I think I did not qualify.

Preparation

Duration: 1.5 month

Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS

Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process

Where: Campus

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

Round

Medium

Video Call

Duration50 minutes

Interview date15 Apr 2021

Coding problem3

Technical round with questions on DSA and OOPs.

1. Find Palindromes

Moderate

25m average time

80% success

0/80

Asked in companies

You are given an integer ‘N’. Your task is to find all palindromic numbers from 1 to ‘N’.

Palindromic integers are those integers that read the same backward or forwards.

Note:

Order of numbers should be in the non-decreasing matter.

For example:

You are given ‘N’ as 12, so the output should be [1, 2, 3, 4, 5, 6, 7, 8, 9, 11], as all single-digit numbers are palindromic, and 11 is also a palindromic number.

Problem approach

In this approach, iterate through the integers 1 to N, then check for each integer if it is a palindrome or not.
To check if an integer is a palindrome, convert the integer into a string and check if it is equal to the reverse.
We define a function isPalindrome(num), where we check if num is palindrome or not and return the result accordingly.

Try solving now

2. Minimum Operations To Make Array Equal

Easy

10m average time

90% success

0/40

Asked in companies

You are given an array ‘ARR’ of length ‘N’ which is filled with the values such that ARR[i] = (2*i + 1). You have to perform operations on the ‘ARR’ to make all elements of the array equal. In one operation, you can choose two elements from the array ‘ARR’ say ‘i’ and ‘j’, and can increment the value of ‘ARR[i]’ by one and decrement the value of ‘ARR[j]’ by one.

You have to find the minimum number of operations to make all the elements of the array ‘ARR’ equal. It is guaranteed that all elements of the array can be made equal using some operations.

Problem approach

The idea behind this approach is we have to calculate the average of all the elements of the array ‘ARR’ because the sum of all elements of the array always remains constant.

Try solving now