Hexaware is a global technology and services company that specializes in providing digital transformation solutions to clients across various industries. With a focus on automation and artificial intelligence, Hexaware helps companies modernize their technology infrastructure and business processes to improve efficiency and increase competitiveness. The company was founded in 1990 and has since established a reputation for delivering high-quality services and solutions to clients around the world. Today, Hexaware has a strong global presence with offices in multiple countries and a diverse client base.
If you're preparing for the Hexaware placement exam, it's essential to follow some best practices and advice to increase your chances of success. One of the most critical factors is to get familiar with the placement exam pattern and syllabus. It's also crucial to practice with placement exam practice questions to get a sense of the type of questions you can expect.
It's recommended to register for the placement exam well in advance and understand the registration process thoroughly. Make sure to have all the necessary documents and information ready before the registration deadline to avoid missing out on the opportunity.
To crack the placement exam, you need to have a solid understanding of the concepts and topics covered in the syllabus. You can refer to various study materials available online or seek guidance from experienced professionals to get a better understanding of the exam.
However, it's important to note that cheating is never the right way to approach the placement exam. Not only is it unethical, but it can also have serious consequences, including being disqualified from future opportunities. Instead, focus on practicing and preparing to the best of your abilities.
In addition to preparing for the exam, it's also helpful to research the Hexaware company culture and interview questions to better understand what the company is looking for in its candidates. This can give you an edge in the interview process and help you land the job.
Eligibility criteria required to apply for the Junior Software Engineer job role:
Numerical Ability
Logical Ability
Verbal Ability
Computer Programming/ Domain Specific MCQs
Coding
Communication Test
Having a clear understanding of the Hexaware Selection Process can greatly benefit candidates as they prepare for the Hexaware Placement Test. Only those who successfully clear each round will move on to the next one. The selection process consists of 3 rounds for GET candidates and 5 rounds for PGET candidates, which are outlined as follows:
For GET Candidates:
For PGET Candidates:
By being familiar with the selection process, candidates can better prepare and increase their chances of success in securing a role with Hexaware.
#Coding Question1
Write a program to reverse a string.
#Solution:
```sh
//Java program to reverse a string
public class Main
{
public static void main(String[] args) {
String stringExample = "Edyst";
System.out.println("Original string: "+stringExample);
//Declaring a StringBuilder
//and converting string to StringBuilder
StringBuilder reverseString = new StringBuilder(stringExample);
//Reversing the StringBuilder
reverseString.reverse();
//Converting StringBuilder to String
String result = reverseString.toString();
// Printing the reversed String
System.out.println("Reversed string: "+result);
}
}
```
#Expected Output
```sh
Original string: Edyst
Reversed string: tsydE
```
#Popular Question1
Python Program to calculate the power without using POW function.(using for loop).
#Coding Question2
Write a program to reverse a number.
#Solution:
```sh
//Java program to Reverse a number
public class Main
{
public static void main(String[] args)
{
int n= 45695832, reversed = 0;
System.out.println("Original Number: " + n);
//Run the loop until n is equal to 0
while(n != 0)
{
//get last digit from n
int digit = n % 10;
reversed = reversed * 10 + digit;
//remove the last digit from num
n /= 10;
}
System.out.println("Reversed Number: " + reversed);
}
}
```
#Expected Output
```sh
Original string: 12345
Reversed string: 54321
```
#Popular Question2
Python Program to sort character of string in descending order.
#Coding Question3
Write a C program to print the Fibonacci series
#Solution:
```sh
//Java program to print Fibonacci Series using recursion.
public class Main
{
static int n1=0,n2=1,n3=0;
static void printFibonacci(int count)
{
if(count>0)
{
n3 = n1 + n2;
n1 = n2;
n2 = n3;
System.out.print(" "+n3);
printFibonacci(count-1);
}
}
public static void main(String args[])
{
int count=15;
//printing 0 and 1
System.out.print("Fibonacci Series: " + n1+" "+n2);
//n-2 because 0 and 1 number are already printed
printFibonacci(count-2);
}
}
```
#Expected Output
```sh
Fibonacci Series: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
```
#Popular Question3
Python program to perform left rotation of array elements by two positions.
#Coding Question4
Write a Program to check palindrome
#Solution
```sh
public static boolean isPalindrome(String input) {
int left = 0;
int right = input.length() - 1;
while (left < right) {
if (input.charAt(left) != input.charAt(right)) {
return false;
}
left++;
right--;
}
return true;
}
```
#Coding Question5
Write a Program Merge Two Sorted Lists
#Solution
```sh
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode curr = dummy;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
curr.next = l1;
l1 = l1.next;
} else {
curr.next = l2;
l2 = l2.next;
}
curr = curr.next;
}
if (l1 != null) {
curr.next = l1;
} else {
curr.next = l2;
}
```
#Coding Question1
Write a program to reverse a string.
#Solution:
```sh
//Java program to reverse a string
public class Main
{
public static void main(String[] args) {
String stringExample = "Edyst";
System.out.println("Original string: "+stringExample);
//Declaring a StringBuilder
//and converting string to StringBuilder
StringBuilder reverseString = new StringBuilder(stringExample);
//Reversing the StringBuilder
reverseString.reverse();
//Converting StringBuilder to String
String result = reverseString.toString();
// Printing the reversed String
System.out.println("Reversed string: "+result);
}
}
```
#Expected Output
```sh
Original string: Edyst
Reversed string: tsydE
```
#Popular Question1
Python Program to calculate the power without using POW function.(using for loop).
#Coding Question2
Write a program to reverse a number.
#Solution:
```sh
//Java program to Reverse a number
public class Main
{
public static void main(String[] args)
{
int n= 45695832, reversed = 0;
System.out.println("Original Number: " + n);
//Run the loop until n is equal to 0
while(n != 0)
{
//get last digit from n
int digit = n % 10;
reversed = reversed * 10 + digit;
//remove the last digit from num
n /= 10;
}
System.out.println("Reversed Number: " + reversed);
}
}
```
#Expected Output
```sh
Original string: 12345
Reversed string: 54321
```
#Popular Question2
Python Program to sort character of string in descending order.
#Coding Question3
Write a C program to print the Fibonacci series
#Solution:
```sh
//Java program to print Fibonacci Series using recursion.
public class Main
{
static int n1=0,n2=1,n3=0;
static void printFibonacci(int count)
{
if(count>0)
{
n3 = n1 + n2;
n1 = n2;
n2 = n3;
System.out.print(" "+n3);
printFibonacci(count-1);
}
}
public static void main(String args[])
{
int count=15;
//printing 0 and 1
System.out.print("Fibonacci Series: " + n1+" "+n2);
//n-2 because 0 and 1 number are already printed
printFibonacci(count-2);
}
}
```
#Expected Output
```sh
Fibonacci Series: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
```
#Popular Question3
Python program to perform left rotation of array elements by two positions.
#Coding Question4
Write a Program to check palindrome
#Solution
```sh
public static boolean isPalindrome(String input) {
int left = 0;
int right = input.length() - 1;
while (left < right) {
if (input.charAt(left) != input.charAt(right)) {
return false;
}
left++;
right--;
}
return true;
}
```
#Coding Question5
Write a Program Merge Two Sorted Lists
#Solution
```sh
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode curr = dummy;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
curr.next = l1;
l1 = l1.next;
} else {
curr.next = l2;
l2 = l2.next;
}
curr = curr.next;
}
if (l1 != null) {
curr.next = l1;
} else {
curr.next = l2;
}
```
When I joined the Edyst courses I received personalized mentoring on how to crack coding rounds of different companies. Through a combination of coding skills and great projects, I received multiple offers above 6+ lakhs per annum. Finally I joined for 8+ Lakhs package. Thanks for all the support, from Edyst Team.
Being a mechanical student and getting into an IT company is very tough. One of the main reason I could able to crack TCS CodeVita is because of Edyst.
Aneeq sir, your doubt clearing sessions, daily assignments & incredible mentors support really brushed up my skills.
Edyst's training style completely resonated with me. I approached programming as more than a subject. Thanks to Edyst team for the guidance!
I started practising on Edyst platform since my 3rd year of college focused on placements & always liked the way they helped us when we were stuck at a particular problem.
Thank you, Edyst for all the assistance and amazing support!
#Coding Question1
Write a program to reverse a string.
#Solution:
```sh
//Java program to reverse a string
public class Main
{
public static void main(String[] args) {
String stringExample = "Edyst";
System.out.println("Original string: "+stringExample);
//Declaring a StringBuilder
//and converting string to StringBuilder
StringBuilder reverseString = new StringBuilder(stringExample);
//Reversing the StringBuilder
reverseString.reverse();
//Converting StringBuilder to String
String result = reverseString.toString();
// Printing the reversed String
System.out.println("Reversed string: "+result);
}
}
```
#Expected Output
```sh
Original string: Edyst
Reversed string: tsydE
```
#Popular Question1
Python Program to calculate the power without using POW function.(using for loop).
#Coding Question2
Write a program to reverse a number.
#Solution:
```sh
//Java program to Reverse a number
public class Main
{
public static void main(String[] args)
{
int n= 45695832, reversed = 0;
System.out.println("Original Number: " + n);
//Run the loop until n is equal to 0
while(n != 0)
{
//get last digit from n
int digit = n % 10;
reversed = reversed * 10 + digit;
//remove the last digit from num
n /= 10;
}
System.out.println("Reversed Number: " + reversed);
}
}
```
#Expected Output
```sh
Original string: 12345
Reversed string: 54321
```
#Popular Question2
Python Program to sort character of string in descending order.
#Coding Question3
Write a C program to print the Fibonacci series
#Solution:
```sh
//Java program to print Fibonacci Series using recursion.
public class Main
{
static int n1=0,n2=1,n3=0;
static void printFibonacci(int count)
{
if(count>0)
{
n3 = n1 + n2;
n1 = n2;
n2 = n3;
System.out.print(" "+n3);
printFibonacci(count-1);
}
}
public static void main(String args[])
{
int count=15;
//printing 0 and 1
System.out.print("Fibonacci Series: " + n1+" "+n2);
//n-2 because 0 and 1 number are already printed
printFibonacci(count-2);
}
}
```
#Expected Output
```sh
Fibonacci Series: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
```
#Popular Question3
Python program to perform left rotation of array elements by two positions.
#Coding Question4
Write a Program to check palindrome
#Solution
```sh
public static boolean isPalindrome(String input) {
int left = 0;
int right = input.length() - 1;
while (left < right) {
if (input.charAt(left) != input.charAt(right)) {
return false;
}
left++;
right--;
}
return true;
}
```
#Coding Question5
Write a Program Merge Two Sorted Lists
#Solution
```sh
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode curr = dummy;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
curr.next = l1;
l1 = l1.next;
} else {
curr.next = l2;
l2 = l2.next;
}
curr = curr.next;
}
if (l1 != null) {
curr.next = l1;
} else {
curr.next = l2;
}
```