ElogicSquare Analytics Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

The online test was scheduled on 10:00 AM. Total 304 students were eligible who appeared for the test. 93 students were shortlisted in this round. MCQs were asked and two coding question

MCQs were of medium to hard level.
OOPS(2 Question)
DBMS(2 questions)
Networking(2 Questions)
Operating System(2 Questions),
Aptitude(2 Questions)

Q1. Maximum Subarray Sum
You are given an array (ARR) of length N, consisting of integers. You have to find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.
A subarr...read more
Ans. 
A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning, and 0 or more integers from the end of an array. I used Kadane's algorithm to solve it optimally. 
Answered by CodingNinjas
Add your answer
Q2. Flipping Coins
Gary has N coins placed in a straight line. Some coins have head side up, and others have the tail side up.
Convention:
1 denotes the HEAD side is up. 
0 denotes the TAIL side is up. 
N...read more
Ans. Brute force
1. The idea is to check every subarray.
2. We can count the number of heads and number tails in every subarray and then calculate the maximum number of heads side up we can obtain if we flip that particular subarray.
3. We also keep a count of the final start index and final end index that will give us the number of heads side up we can obtain later.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only ...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was technical interview round, which was purely based on coding followed by 1 SQL query. Duration of round was of 1 hour from 10 AM-11AM. Interviewer asked me 2 Coding questions one to solve and run on Hackerrank codepair platform and for another one she asked only my approach to solve problem. In the remaining last 10 minutes interviewer asked me 1 SQL query on JOIN. Total 28 students were shortlisted in this round.

Q1. First Missing Positive
You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowe...read more
Ans. 
I gave him the optimized solution.
Answered by CodingNinjas
Add your answer
Q2. Kth missing element
Given an increasing sequence 'VEC', find the 'Kth' missing contiguous element in the given sequence starting from the leftmost element of the array.
Example :
Given &...read more
Ans. 
I told the solving approach by using max heap in O(NlogK) time complexity.
Answered by CodingNinjas
Add your answer