i
Hexaware Technologies
Filter interviews by
I applied via Campus Placement and was interviewed before Sep 2023. There were 5 interview rounds.
Aptitude questions and 3 coding questions
Hexaware offers a collaborative work environment, cutting-edge technologies, and opportunities for growth and learning.
Hexaware provides a collaborative work environment where developers can work together to solve complex problems.
The company uses cutting-edge technologies and tools, allowing developers to stay up-to-date with the latest trends in software development.
Hexaware offers opportunities for growth and learni...
Hexaware is a global IT services company providing automation, cloud, and digital solutions.
Hexaware was founded in 1990 and is headquartered in Mumbai, India.
They offer services in areas such as application transformation, infrastructure management, and business process services.
Hexaware has a strong focus on automation and digital technologies to help clients improve efficiency and innovation.
The company has a global...
What people are saying about Hexaware Technologies
posted on 15 Jan 2025
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Strengths include problem-solving skills and adaptability. Weaknesses include perfectionism and time management.
Strengths: problem-solving skills, adaptability
Weaknesses: perfectionism, time management
Example: I excel at quickly identifying and resolving complex technical issues, but I sometimes struggle with prioritizing tasks effectively.
Types of relationships in DBMS include one-to-one, one-to-many, and many-to-many relationships.
One-to-one relationship: Each record in one table is related to only one record in another table.
One-to-many relationship: Each record in one table can be related to multiple records in another table.
Many-to-many relationship: Multiple records in one table can be related to multiple records in another table.
Examples: One-to-o...
A pointer in programming is a variable that stores the memory address of another variable.
Pointers allow for direct manipulation of memory locations
They are commonly used in languages like C and C++
Example: int *ptr; ptr = # // ptr now points to the memory address of num
posted on 12 Dec 2022
I applied via Naukri.com and was interviewed in Jun 2022. There were 4 interview rounds.
Data structure Hash Map problem and java 8 code
Coding singlton code and immutable code hashcode equals java 8 code data structure spring boot microservicis
posted on 4 Apr 2024
posted on 9 Sep 2022
I applied via Naukri.com and was interviewed in Aug 2022. There were 2 interview rounds.
Easy gfg , indibix are enough
posted on 11 Sep 2022
I applied via Campus Placement and was interviewed in Aug 2022. There were 2 interview rounds.
The test contains aptitude ques and one coding ques
posted on 22 Sep 2024
Some difficulty is there but on hard work u can crack
It's a technical round
I am impressed by the company's innovative projects, strong team culture, and commitment to employee growth.
Innovative projects such as developing cutting-edge software solutions for healthcare industry
Strong team culture focused on collaboration and continuous learning
Commitment to employee growth through training programs and career development opportunities
My strengths include problem-solving skills, adaptability, and strong technical knowledge.
Strong problem-solving skills - I enjoy tackling complex issues and finding creative solutions.
Adaptability - I am able to quickly learn new technologies and adapt to changing project requirements.
Strong technical knowledge - I have a solid understanding of various programming languages and frameworks.
I appeared for an interview before Mar 2021.
Round duration - 75 minutes
Round difficulty - Medium
This was an online coding round where we had 2 questions to solve under 75 minutes. I found both the questions to be of Easy to Medium level of difficulty.
You are given several sets of points on a 2D plane, each set represented as a list of coordinates. Your task is to determine if there exists a line parallel to the Y-axis...
The task is to determine if there exists a line parallel to the Y-axis that reflects given points symmetrically.
Iterate through each test case and check if a vertical reflection line exists for the given points
Calculate the midpoint of the x-coordinates and check if it reflects the points symmetrically
Consider edge cases where points are on the reflection line or have the same x-coordinate
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 coding questions followed by some questions from DBMS.
You are given an array/list HEIGHTS
of length N
, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.
Find the area of the largest rectangle that can be formed within the bounds of a given histogram.
Iterate through the histogram bars and calculate the area of the largest rectangle that can be formed using each bar as the height.
Use a stack to keep track of the indices of the bars in non-decreasing order of height.
Pop elements from the stack and calculate the area until a smaller height bar is encountered.
Update the max...
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
The task is to determine if a given string consisting of parentheses is balanced or not.
Iterate through the characters of the string and use a stack to keep track of opening parentheses.
If an opening parenthesis is encountered, push it onto the stack.
If a closing parenthesis is encountered, check if it matches the top of the stack. If it does, pop the stack, else the string is not balanced.
At the end, if the stack is e...
ACID properties in DBMS ensure data integrity and consistency in transactions.
Atomicity: All operations in a transaction are completed successfully or none at all.
Consistency: Data is always in a valid state before and after a transaction.
Isolation: Transactions are isolated from each other to prevent interference.
Durability: Once a transaction is committed, changes are permanent and survive system failures.
Example: If...
Levels of data abstraction in a DBMS refer to the different views of data provided to users and applications.
Physical level: Deals with how data is stored on the storage media. Example: data blocks, pages, indexes.
Logical level: Focuses on how data is represented to users. Example: tables, views, constraints.
View level: Provides a customized view of the database for specific users or applications. Example: queries, rep
Round duration - 60 minutes
Round difficulty - Medium
Standard DS/Algo round with 2 coding questions followed by 2 interesting puzzles.
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
Detect if an undirected graph contains a cycle by exploring all possible paths.
Use Depth First Search (DFS) algorithm to traverse the graph and detect cycles.
Maintain a visited set to keep track of visited vertices and a parent pointer to avoid visiting the same vertex twice.
If a visited vertex is encountered that is not the parent of the current vertex, a cycle is present.
Consider edge cases like disconnected graphs a
Given a matrix ARR
with dimensions N
* M
, consisting only of 0s and 1s where each row is sorted, determine the index of the row that contains the highest number of 1s. If multi...
Find the row with the maximum number of 1s in a sorted matrix.
Iterate through each row of the matrix and count the number of 1s in each row
Keep track of the row index with the maximum number of 1s
Return the index of the row with the highest count of 1s
By lighting both wires at the same time, the shorter wire will burn out first, allowing you to measure a specific duration of time.
Light both wires at the same time
Measure the time it takes for the shorter wire to burn out completely
The remaining length of the longer wire will indicate the specific duration of time
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Recruitment Consultant and was interviewed before Oct 2019. There were 3 interview rounds.
I am always eager to take up new responsibilities, tasks, and technologies.
I am a quick learner and enjoy challenging myself with new tasks and technologies.
I regularly attend workshops and training sessions to keep myself updated with the latest technologies.
I have taken up new responsibilities in my previous roles, such as leading a team or taking ownership of a project.
I am open to feedback and constructive criticis
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Senior Software Engineer
3.8k
salaries
| ₹5.5 L/yr - ₹20 L/yr |
Software Engineer
3k
salaries
| ₹2 L/yr - ₹10 L/yr |
System Analyst
2.9k
salaries
| ₹7.7 L/yr - ₹29 L/yr |
Technical Architect
2.1k
salaries
| ₹10 L/yr - ₹38 L/yr |
Senior Executive
1.9k
salaries
| ₹0.8 L/yr - ₹6 L/yr |
Cognizant
TCS
DXC Technology
Mphasis