Tip 1: Practice basic coding questions.
Tip 2: Study everything in detail.
Tip 3: Have knowledge of databases.
Tip 1:Have some projects on your resume.
Tip 2: Do not put false information on your resume.
In the Aptitude Test, candidates will encounter three sections: English, Analytical Reasoning, and Quantitative Aptitude. This test spans 60 minutes and comprises 60 questions. Notably, there is no negative marking for incorrect answers.
QUESTION 1- In a class, the total number of students is 72. Which of the following can be the ratio of the number of girls and boys in the class?
a)3: 5
b)10: 13
c)8: 11
d)7: 9
QUESTION 2- She packed her bag but forgot to take ___ maths notebook.
a)an
b)No article required
c)a
d)the
QUESTION 3- Find the missing term in the series given below.87, 118, 151, 187, 227, 272,?a)323
b)423
c)315
d)320
Candidates who successfully clear the cut-off score in the Aptitude Test will proceed to the Technical Test. The Technical Test consists of two sections: Pseudocode and Computer Fundamentals. This test spans 30 minutes and includes 30 questions.
Q.1.What is the output of this C code?#
#include <stdio.h>
#include <string.h>
int main(){
char *str = "hello world";
char strary[] = "hello world";
printf("%d %d\n", strlen(str), strlen(strary));
return 0;
}
a) x 11 where x can be any positive integer
b) 1211
c) 1111
d) 1112
Q2. Which of these classes holds a collection of static methods and variables?
a) Runtime,
b) System,
c) Process,
d) Void
Q3. Which of the three sizes of floating-point types should be used when extended precision is required?
a) Float
b) long double
c) Double
d) Extended float
Candidates who successfully meet the cut-off score in the Technical Test will advance to the Programming Test. This stage evaluates candidates' programming proficiency and problem-solving skills. The Programming Test comprises two questions and has a duration of 40 minutes.



Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.
1. Determine the length of the array, denoted as 'n'.
2. Normalize 'k' by calculating its modulo 'n' (k = k % n).
3. Reverse the entire array using a two-pointer approach.
4. Reverse the first 'k' elements of the array.
5. Reverse the remaining elements from the 'k+1'th position to the end.
6. The array is now rotated by 'k' positions.



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
1. Initialize three pointers: prev (NULL), current (head of the original list), next (NULL)
2. Traverse the list:
-Set next to the current's next node.
-Set current next to prev, reversing the pointer.
-Move prev to current and current to next.
3. Update the head pointer to prev after the traversal.
4. Return the new head of the reversed list.
The Hexaware Communication Assessment for freshers is a crucial elimination round focusing on evaluating candidates' communication skills. With a total of 67 questions, the assessment centers on four key components:
Vocabulary
Fluency
Pronunciation
Sentence Mastery
Candidates are judged based on their proficiency in these areas. Success in this round is essential for securing various roles within Hexaware. It's advised to review the provided resources thoroughly to prepare effectively.
In this assessment round, candidates undergo four sections to evaluate their communication and speaking abilities:
Section 1: ReadingCandidates are given sentences on the screen and provided 20-30 seconds to read them. The objective is to assess their reading comprehension and speaking capability. Candidates are advised to read calmly and avoid rushing to ensure understanding.
Section 2: Repeating SentencesCandidates listen to audio sentences and repeat them aloud. This assesses their ability to pronounce words correctly and replicate spoken sentences accurately.
Section 3: Jumbled SentenceCandidates listen to jumbled sentence audio files and unscramble them to read aloud. This section evaluates mental abilities and sentence mastery skills.
Section 4: Story Telling Candidates listen to a short story audio file twice and have 30 seconds to summarize it in their own words. This tests fluency, vocabulary, and memorization skills. Overall, this assessment round aims to gauge candidates' communication skills across various aspects, including reading, pronunciation, sentence construction, and storytelling ability.
During the interview, candidates were presented with a variety of challenges encompassing data structure coding problems, object-oriented programming (OOP) concepts, and project explanations as outlined on their resumes. The interview commenced with a brief introduction, allowing candidates to present themselves. Subsequently, they were tasked with addressing two data structure coding problems, followed by an inquiry into OOP principles. Additionally, candidates were prompted to explain projects listed on their resumes, covering aspects such as database management systems (DBMS) and conventional data structure and algorithm (DSA) questions.
What do you mean by DBMS?
What are the primary key and foreign key? (Link)
What are OOPs and their features? Explain all the features with examples. (Link)
Given a year, write a program to determine if it is a leap year or not.
I used the brute force approach and the concept of leap year.



You are given an array of integers 'ARR' of size 'N' and another integer 'K'.Your task is to find and return 'K'th smallest value present in the array.
Note: All the elements in the array are distinct.ExampleIf 'N' is 5 and 'K' is 3 and the array is 7, 2, 6, 1, 9Sorting the array we get 1, 2, 6, 7, 9Hence the 3rd smallest number is 6.
I solved this problem using a priority queue.
This HR round primarily consisted of basic HR questions aimed at understanding the candidate's background, skills, and suitability for the role.
1. Tell me about yourself.
2. Where do you see yourself five years from now?
3. Are you ready to relocate?
4. Do you have any questions for me?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?