HexaView Technologies Applications Engineer Interview Questions, Process, and Tips

Q1. All questions were related to DSA OS DBMS
Add your answer

Q1. Question related to arrays
Add your answer

Q1. Project discussion and oops,DBMS, computer networks concepts
Add your answer

Q1. Que on stable partition
Add your answer

Q1. 3 technical rounds , first two were coding and databases . Last one will be project + tech stack. Avg level of interview questions
Add your answer

ANY OF THE CODING PLATFORM

Q1. OOPS , SQL , LINKEDLIST
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

First-round was the Coding round on Skype in the morning around 10 am.

We had to write programs on paper and share the photo personally on Skype with the Interviewer.

There were set including 2 questions.

We had the choice of writing the program in C,C++,Java,C# (Python was strictly Prohibited).
Time allotted for both programs- 40 minutes

We had to implement the given function only (it was mandatory) and had to write the complexity of the problem also.

We had to keep our Camera ON failing to which candidate could have face on-the-spot rejection.

Q1. 
Missing Number Problem Statement
You are provided with an array named BINARYNUMS consisting of N unique strings. Each string represents an integer in binary, covering every integer from 0 to N except for ...read more
Ans.  Convert to integers (Sorting)
In this approach, we will create an array of integers ‘nums’, by converting each string present in list ‘binaryNums’ in the integers they represent.
A binary string can be converted into a respective integer by simply traversing from rightmost character (least significant bit) to leftmost character (most significant bit) and for each position of set bit i.e (index where char is ‘1’) we add ...read more
Answered Anonymously
Add your answer
Q2. 
Minimum Special Sum Problem
You are given an array ARR of length N. There are two operations defined for each index i in the array:
1. FIRST_SUM(i): Calculates the sum of the first i numbers.
2. LAST_SUM(i...read more
Ans. Brute force
The main idea is to calculate the ‘FIRST_SUM’ and the ‘LAST_SUM’ for every index ‘i’ between [0, N - 1].
 
• FIRST_SUM can be calculated easily by looping from range 0 to the ‘ith’ number we want and adding all of the numbers.
• Similarly, LAST_SUM can be calculated easily by looping from (N - 1)th element to the (N - i - 1)th element and adding all the numbers in between.
• Maintain a variable ‘MIN_SPECIAL_SUM’ ...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Second round was the technical round which held after 4 hours of the coding round same day (at 2 pm). In my second round, Interviewer asked the questions from Data structures and algorithms, OOPS concepts, DBMS, one puzzle and one chess question (because in my introduction I said that I am a chess player)

Round duration - 60 Minutes
Round difficulty - Hard

The second round held same day after the first technical round. The second round was bit tough. He started asking some fundamentals questions from DS Algo, OOPs, DBMS, and other CS stuff and then he gradually increased the difficulty of the questions. At last, he asked me to write the code to print the pattern he gave, which I was able to do so he was impressed.

Q1. 
Number Pattern Problem Statement
Given an integer 'N', print a specific pattern on 'N' lines where numbers are aligned in a particular format.
Example:
Input:
N = 4
Output:
   1
  232
 34543
4567654
Ex...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

The fourth and final technical round held the same day. He first asked me to send my resume to him through chat then he asked me questions related to my projects and skills. At last he gave me two coding problems and one riddle.

Q1. 
Pattern Printing Task
You are tasked with printing a specific pattern based on the given number of rows, 'N'. For any input value of 'N', generate and print a pattern as described in the example.
Input:
...read more
Ans. Observation
We can observe that there are ‘N’ numbers of rows (where ‘N’ is the total number of rows to be printed). Each row contains a different value in the first column and its value increments by 1 for each subsequent column.
 
Algorithm:
 
• Declare an array of strings for storing the pattern.
• Declare a variable ‘startValue’  and initialize its value to 1.
• Declare a variable ‘row’ for keeping track of the n...read more
Answered Anonymously
Add your answer
Q2. 
Spiral Matrix Problem Statement
You are given a N x M matrix of integers. Your task is to return the spiral path of the matrix elements.
Input
The first line contains an integer 'T' which denotes the nu...read more
Ans. Spiral Matrix
Divide the matrix into loops. Print all the elements in the clockwise order from the first-outer layer, followed by the elements from the second outer layer, and so on. Use four loops to print all the elements. Every ‘for’ loop defines a single direction movement along with the matrix. The first loop represents the movement from left to right, the second loop represents the movement from top to bottom, the...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

He asked me some general Questions