Hexaview Technologies interview experience Real time questions & tips from candidates to crack your interview
Technical Associate
Hexaview Technologies
4 rounds | 18 Coding
problems
Selected Interview preparation journey
Journey
Hexaview Technologies visited my college for campus placements. The process began with a DSA/coding round, where I solved problems to showcase my coding skills. After clearing that, I faced three technical interviews. Each interview tested my knowledge, problem-solving abilities, and technical concepts. It was a challenging yet rewarding journey that helped me grow and learn.
Application story
Hexaview visited my college for campus placements. The process began with a DSA/coding round, where I solved problems to showcase my coding skills. After clearing that, I faced three technical interviews. Each interview tested my knowledge, problem-solving abilities, and technical concepts. It was a challenging yet rewarding journey that helped me grow and learn.
Why selected/rejected for the role?
I believe I was selected because I highlighted my DSA-related skills and showcased my main project on my resume. During the interviews, I was able to confidently answer questions related to both, which likely strengthened my chances.
Preparation
Duration: 1 Month
Topics: Data Structures, OOPs, CPP, C, SQL, DBMS
Tip 1 : Focus on logic building
Tip 2 : Showcase your DSA knowledge on your resume
Application process
Where: Campus
Eligibility: CGPA Above 7 (Salary package: 6 LPA)
Tip 1: Mention DSA and the number of problems solved on your resume.
Tip 2: Include 2-3 projects in your resume.
Interview rounds
01
Round
Medium
Online Coding Test
Duration50 minutes
Interview date17 Jul 2023
Coding problem2
This round was held in the afternoon for 50 minutes and included 2 DSA questions of easy to medium difficulty.
1. Number of occurrence
Moderate
26m average time
0/80
Asked in companies
Write a program to find the number of occurrences of a given key.
Problem approach
We can easily solve this problem by iterating over the array with the help of any loop (i.e. for, while) & calculate how many times the key has occurred in that array
2. Admission in Ninja Gram
Easy
15m average time
80% success
0/40
Asked in companies
Write a program to check whether the given string is pangram or not Pangram - It is a sentence containing all letters of the English Alphabet.
Problem approach
We can use a Set data structure to check if a string is a pangram. Here’s how it works:
* Convert each character of the string into lowercase to handle case sensitivity.
* Add each letter of the string into a set.
* In a set, duplicate characters are not allowed, so each letter will be added only once, regardless of how many times it appears in the string.
* At the end, check the size of the set. If the size is 26 (the total number of English alphabets), then the string is a pangram.
Otherwise, it is not a pangram.
02
Round
Medium
Video Call
Duration70 minutes
Interview date21 Jul 2023
Coding problem5
This rounds includes various questions like :
* Explain SQL query
* OOPS concept
* Difference between abstract class vs interface
* What is diff between list vs linked list
* Explain keys, prime key, unique key
* What are the limitations of inheritance
03
Round
Medium
Video Call
Duration80 minutes
Interview date24 Jul 2023
Coding problem6
SQL based and DSA based questions were asked
1. Merge Two Sorted Linked Lists
Moderate
15m average time
80% success
0/80
Asked in companies
Given two unsorted Linked List, the task is to merge them to get a sorted singly linked list.
Problem approach
Concatenate the two lists by traversing the first list until we reach it’s a tail node and then point the next of the tail node to the head node of the second list. Store this concatenated list in the first list.
Sort the above-merged linked list. Here, we will use a bubble sort. So, if node->next->data is less then node->data, then swap the data of the two adjacent nodes.
3. DBMS
What are ACID properties? (Learn)
04
Round
Hard
HR Round
Duration60 minutes
Interview date7 Aug 2023
Coding problem5
The round was combination of HR & Technical.
1. Introduce yourself.
2. Tell us about your strengths & weaknesses.
3. What are your short & long term goals?
4. Puzzle
There are 3 ants sitting on three corners of a triangle. All ants randomly pick a direction and start moving along edge of the triangle. What is the probability that any two ants collide?
5. What is your Area of interest?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
MTS 1
4 rounds | 15 problems
Interviewed by Hexaview Technologies
Selected 
0 views
0 comments
0 upvotes
Application Engineer
4 rounds | 6 problems
Interviewed by Hexaview Technologies
Selected 865 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3451 views
0 comments
0 upvotes
SDE - 1
3 rounds | 8 problems
Interviewed by Hexaview Technologies
Rejected
213 views
0 comments
0 upvotes
Companies with similar interview experiences
Technical Associate
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 506 views
0 comments
0 upvotes