HexaView Technologies Software Developer Interview Questions and Answers

One hour aptitude test, after clearing that, some basic coding questions were unlocked.

This one was face to face. Basically, the approach to the question was seeked by the HRs rather than the correct answer only.

Q1. This included two rounds, one with HR and one with CEO. Questions were based on real life logics and basic mathematics
Add your answer
Q2. Based on real life and quants with some HR Questions.
Add your answer
Q3. Like: What salary do you expect
Ans. 
I expect a competitive salary based on my skills, experience, and the market rate for software developers.
• Research the average salary range for software developers in your location and industry.

• Consider your level of experience, education, and any specialized skills you possess.

• Factor in the company's size, reputation, and financial stability.

• Be prepared to negotiate and discuss benefits and perks in addition to salary...read more
Answered by AI
Add your answer

Mcq + dsa JavaScript questions

Q1. JavaScript advance topics and database design topics
Add your answer

Q1. Situation based question and behavioural questions
Add your answer

Q1. Print unique numbers in list
Ans. 
Print unique numbers in list
• Iterate through the list and store each number in a set to keep track of unique numbers

• Print out the numbers in the set to display the unique numbers
Answered by AI
Add your answer

They would ask searching sorting , binary search in first round

Q1. Most of question were from Tree and DP
Add your answer
Q2. Delete a node from a binary tree.
Ans. 
Delete a node from a binary tree.
• Find the node to be deleted

• If the node has no children, simply delete it

• If the node has one child, replace it with its child

• If the node has two children, find the minimum value in its right subtree, replace the node with that value, and delete the minimum value node
Answered by AI
Add your answer

Duration 1 hour
Data structure and algorithms

Duration 1.5 hour
Data structure and algorithms

Q1. Given a value find next sibling on right side of it without using global/heap variables
Ans. 
Use a binary tree traversal algorithm to find the next sibling on the right side of a given value.
• Implement an in-order traversal algorithm to traverse the binary tree

• Keep track of the parent node and the direction of traversal to find the next sibling on the right side

• If the given value is the right child of its parent, move up the tree until finding a node that is the left child of its parent
Answered by AI
Add your answer

Questions related to input and output.

Subjective Round:4 questions related to coding.

Q1. 3 Interview round and finally HR round
Add your answer