Accolite Digital INTERVIEW EXPERIENCE
It was an off campus She code hiring opportunity and there were total 5 rounds.
ROUND 1 – ONLINE ASSESSMENT
Duration – 90 min
30 MCQs on CS Fundamentals
1 coding question
Count minimum steps to get the given desired array
# Python3 program to count minimum number of
# operations to get the given target array
def countMinOperations(target, n):
# Initialize result (Count of minimum moves)
result = 0;
# Keep looping while all elements of
# target don't become 0.
while (True):
# To store count of zeroes in
# current target array
zero_count = 0;
# To find first odd element
i = 0;
while (i < n):
# If odd number found
if ((target[i] & 1) > 0):
break;
# If 0, then increment
# zero_count
elif (target[i] == 0):
zero_count += 1;
i += 1;
# All numbers are 0
if (zero_count == n):
return result;
# All numbers are even
if (i == n):
for j in range(n):
target[j] = target[j] // 2;
result += 1;
for j in range(i, n):
if (target[j] & 1):
target[j] -= 1;
result += 1;
# Driver Code
arr = [16, 16, 16];
n = len(arr);
print(countMinOperations(arr, n));
ROUND 2 – TECHNICAL INTERVIEW
Duration – 30 min
Indroduction
Project discussion
1 coding questions
You have 2 string without convert into integer add them and give sum of both string .
(Sum of two large numbers in gfg)
OOPS concepts – Polymorphism, Virtual keyword
DDL and DML command
DROP vs DELETE vs TRUNCATE
Any questions.
ROUND 3 – TECHNICAL INTERVIEW
Duration – 60 min
Introduction
Project discussion
You have n numbers of telephone numbers count how many unique telephone number and how many same telephone number (use unordered map for storing number and it’s freq like key value pair solution key is telephone number and value is it’s freq)
Stack and queue real life implementation
What is linked list and how would you check if it is circular or not?(only approach I mention 3 approach)
Merge sort and quick sort
Graph and tree (theory)
3 Coding question
Implement queue using 2 stacks
Merge 2 sorted arrays
print fibonacci series in equilateral series
Basic output question on pre and post increment operator
int a;
i=5;
a=++i+i–;
print a and i value
Swap the value of 2 variables without using extra variable
Any questions.
ROUND 4 – TECHNICAL INTERVIEW
Duration – 30 min
Introduction
Project discussion
Basic OOPS Question
What all data structures do you know?
BFS AND DFS
sorting algorithm like where we use insertion sort and where quick and merge all sorting algorithm where we use all sorting algorithm
which sorting algo is best and why
A coding question
it was look and say problem.
one ques base on aptitude problem but idea is apply dsa concept
we have 100 apples and 2 box 1 apple wait is 200 g and all 99 apple wait is 100 g so find out which apple have 200 g wait (apply divide and conquer approach)
Any questions.
ROUND 5 – HR ROUND
Duration – 30 min
Introduction
Project
talking about my hometown like what is famous thing and what is unique thing.
Why should we hire you?
Long term and short term goals
where do you see yourself in 5 years?
strengths and weakness
Then she said “Yes, you are selected!!” and discussed about the salary and other details about the company.
I hope it was helpful !!