HexaView Technologies Interview Questions, Process, and Tips

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. 
Given an array of unique binary strings representing integers from 0 to N, find and return the missing integer's binary representation without leading zeros.
• Iterate through the array of binary strings and convert each string to its decimal equivalent.

• Calculate the sum of all integers from 0 to N using the formula (N * (N + 1)) / 2.

• Subtract the sum of the converted integers from the total sum to find the missing integer...read more
Answered by AI
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. 
Find the minimum special sum for each index in an array by calculating the sum of first and last elements.
• Iterate through the array and calculate the special sum for each index using the given operations.

• Keep track of the minimum special sum encountered so far.

• Return the minimum special sum found for all indices in the array.
Answered by AI
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. 
Print a specific number pattern on 'N' lines where numbers are aligned in a particular format.
• Iterate through each row from 1 to N

• Print spaces before the numbers based on the row number

• Print numbers in increasing order up to the row number, then in decreasing order
Answered by AI
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. 
The task is to print a specific pattern based on the given number of rows, 'N'.
• Iterate through each row and print the numbers in the specified pattern

• Use loops to print the numbers in the required order

• Ensure there is exactly one space between each value in a row
Answered by AI
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. 
The task is to return the spiral path of elements in a given matrix.
• Iterate through the matrix in a spiral path by adjusting the boundaries of rows and columns.

• Keep track of the direction of traversal (right, down, left, up) to form the spiral path.

• Handle edge cases such as when the matrix is a single row or column.

• Implement a function to print the spiral path of the matrix elements.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

He asked me some general Questions

Round duration - 60 Minutes
Round difficulty - Hard

Q1. 
Wildcard Pattern Matching Problem Statement
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...read more
Ans. 
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
• Create a recursive function to match the pattern with the text character by character

• Handle cases for '?' and '*' characters in the pattern

• Keep track of the current position in both pattern and text strings

• Return 'True' if the pattern matches the text completely, otherwise return 'False'
Answered by AI
Add your answer
Q2. 
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...read more
Ans. 
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
• Traverse the tree to find the start node and calculate the time for fire to spread to all nodes.

• Use a queue to keep track of nodes to be burnt next.

• Increment time for each level of nodes burnt until the entire tree is burnt.
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy