HexaView Technologies Interview Questions, Process, and Tips

Aptitude and technical questions.

• Q1. 1.2 hrs of interview with coding questions and DSA and DBMS and puzzles. Add Answer

• Q1. 1.3 hrs of coding test and DSA and puzzles. Add Answer

• Q1. Design of algorithms and puzzles and DBMS View Answers (1)

• Q1. Find duplicate numbers, prime num er program View Answers (1)

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 You are given an array/list ‘BINARYNUMS’ that consists of ‘N’ distinct strings which represent all integers from 0 to N in binary representation ...read more View Answers (4)
• Q2. Special Sum You are given an array ‘ARR’ of length ‘N’. There are two operations, ‘FIRST_SUM’ and ‘LAST_SUM’ for every index ‘i’ (1 <= i <= N) in the arra...read more View Answers (2)

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)

• Q1. Technical Questions 1. Which Data Structure is best, Linked List or Array and why? 2. Comparison of Time complexity of insertion, deletion, and searching in an ...read more Add Answer
• Q2. Puzzle Four people are trying to cross a sketchy rope bridge in the middle of the night. Only two can cross at a time. They only have one flashlight, and so one...read more Add Answer

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 Print the following pattern Pattern for N = 4 The dots represent spaces. Input Format : N (Total no. of rows) Output Format : Pattern in N lines...read more View Answers (1)

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. Print the Pattern Ninja is given a pattern. Now he is asked to print the same pattern for any given ‘N’ number of rows. Note: There is only one space between th...read more View Answers (1)
• Q2. Spiral Matrix You are given a N x M matrix of integers, return the spiral path of the matrix Example Of Spiral Path Input Format: The first line contains an int...read more View Answers (2)

Round duration - 60 Minutes
Round difficulty - Medium

He asked me some general Questions

• Q1. Basic HR Questions

  Introduce yourself, why do you want to join the company, what do you know about the company etc.

  Add Answer

Round duration - 60 Minutes
Round difficulty - Hard

• Q1. Wildcard Pattern Matching Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wi...read more View Answers (3)
• Q2. Time To Burn Tree You have been given a binary tree of 'N' unique nodes and a Start node from where the tree will start to burn. Given that the Start no...read more View Answers (2)

Round duration - 20 Minutes
Round difficulty - Easy

• Q1. Basic HR Questions

  Willing to relocate?

  What is your biggest achievement?

  Able to handle pressure?

  Add Answer

• Q1. Easy question on DBMS OPPs DSA Add Answer

• Q1. Medium question on DSA OOPs DSA Add Answer

• Q1. Hard question DSA OOPs DBMS Add Answer

• Q1. OOPs Concept, Database Concept. Add Answer
• Q2. ACID Properties View Answers (1)

• Q1. Java Interface, Java Class Add Answer