179 questions from 39 interviews · updated from reports 2019-2024
About
Hexaware Technologies is an IT services and consulting company that provides software development, cloud, data, automation, and business process services to clients across industries. In India, it is known for hiring entry-level technical roles such as PGET, Graduate Engineer Trainee, and GET.
The roles that come up most are PGET, Graduate Engineer Trainee and Graduate Engineer Trainee (GET). This covers 39 candidate interviews reported from 2019 to 2024. Most sat it at entry level (37 of 38 that recorded a level), with 1 internship interviews alongside. Among the 33 that recorded either route, arrivals split between campus drives (24, 73%) and off-campus applications (9, 27%). Most questions fall under CS fundamentals and DSA.
Ans. ACID properties are the guarantees that make database transactions reliable: Atomicity, Consistency, Isolation and Durability. Atomicity means all or nothing, Consistency keeps valid rules, Isolation prevents concurrent transactions interfering, and Durability ensures committed changes survive crashes. They are essential for correctness in systems handling critical data.
Ans. Use two pointers, one at the start and one at the end of the string, and compare characters while moving inward. If any pair differs, it is not a palindrome; otherwise it is. This uses no extra data structure beyond indices, runs in O(n) time and O(1) space.
Ans. The SDLC phases are planning, requirements analysis, design, implementation, testing, deployment and maintenance. Planning defines scope and feasibility, requirements capture what users need, design describes the architecture, implementation builds it, testing verifies quality, deployment releases it, and maintenance fixes issues and improves the software over time.
Ans. To check whether a number is an Armstrong number, count its digits, sum each digit raised to that count, and compare the sum with the original number. For example, 153 is valid because 1³ + 5³ + 3³ = 153. Process digits using division and modulo. Time complexity is O(d), space is O(1).
Ans. Use a recursive function fib(n) where fib(0) returns 0, fib(1) returns 1, and every other value returns fib(n minus 1) plus fib(n minus 2). Call it for each index from 0 to n minus 1 and store results in a list. The naive recursive time complexity is exponential, O(2^n).
Ans. Scan the array once, keeping two variables: largest and secondLargest. Initialise them from the first two elements in correct order, then compare each remaining element with largest and secondLargest, updating as needed. No extra data structure is needed beyond variables. The time complexity is O(n), with O(1) space.
Ans. Use Floyd’s tortoise and hare algorithm: keep two pointers, one moving one node at a time and the other moving two nodes at a time. If they ever meet, there is a cycle. If the fast pointer reaches null, there is no cycle. It uses constant extra space and runs in O(n) time.
Ans. JDBC connectivity in Java is the process of using the Java Database Connectivity API to connect a Java application to a database, send SQL queries, and read results. The main steps are loading the driver, creating a connection, preparing a statement, executing it, processing the result set, and closing resources.
Ans. Identify the rule that links the items, then apply it consistently. Look for changes in shape, number, position, direction, size, colour, sequence or grouping. Compare each option against the rule and eliminate mismatches. Work systematically, avoid assumptions, and check whether more than one pattern is operating at the same time.
Ans. Scan the array once, keeping two values: the largest seen so far and the second largest. For each number, update the largest if it is bigger, otherwise update the second largest if it lies between them. Usually this means second distinct maximum. This uses constant space and runs in O(n) time.
Ans. Use a correlated subquery when the inner query must be evaluated for each row of the outer query, because it depends on a value from that row. Typical cases are finding rows above their group average, checking existence with EXISTS, or excluding matches with NOT EXISTS. The key is correctly linking inner and outer aliases.
Ans. Common programming problems based on sorting include sorting an array, merging intervals, finding duplicates, kth largest element, sorting 0s 1s and 2s, and arranging numbers to form the largest value. The key detail is choosing the right method: comparison sort is usually O(n log n), while counting sort can be O(n) when values are bounded.
Ans. A graph is a data structure made of vertices, or nodes, connected by edges. Edges may be directed or undirected, and may have weights. Graphs model relationships such as social networks, road maps, web links, dependencies, and communication networks. They are commonly stored using an adjacency list or adjacency matrix.
Ans. Use JOIN to combine rows that match a related key, and CROSS JOIN to return every possible pairing of rows from two tables. For example, join customers to orders on customer_id to show each customer’s orders. Cross join products with colours to generate all product and colour combinations. JOIN depends on a condition; CROSS JOIN does not.
Ans. Select the distinct salaries, order them in descending order, then skip N minus 1 rows and return the next one. The key detail is using distinct values, otherwise duplicate salaries can make the result wrong. In databases with window functions, DENSE_RANK over salary descending is the usual robust approach.
Ans. Object-Oriented Programming models software as objects that combine data and behaviour. The main concepts are encapsulation, which hides internal state; abstraction, which exposes only needed details; inheritance, which reuses and extends existing classes; and polymorphism, which lets different objects respond to the same interface in their own way.
Ans. Searching algorithms include linear search, which checks each item in O(n), and binary search, which halves a sorted list in O(log n). Sorting algorithms include bubble, selection and insertion sort, usually O(n²), and faster divide-and-conquer sorts like merge sort and quicksort, typically O(n log n). Choice depends on data size, order and stability needs.
Ans. A file system stores data as files and directories, while a DBMS stores data in structured databases with query, transaction and integrity support. The key difference is that a DBMS manages relationships, concurrency, security, indexing and recovery, whereas a file system mainly provides basic storage and access, leaving organisation and consistency to applications.
Ans. Create a base class, for example Shape, with a virtual method such as area, then create derived classes like Circle and Rectangle that override it. Store or pass objects through Shape pointers or references, so calling area uses runtime dispatch. The key detail is declaring the base function virtual.
Ans. Method overriding happens when a subclass provides its own implementation of a method already defined in its parent class. For example, an Animal class may have a speak method, while a Dog class overrides speak to return “bark”. When called through an Animal reference, the Dog version runs at runtime.
Ans. A strong answer should choose a balanced, real example where AI changed tasks, not just headcount. Emphasise productivity gains, job redesign, reskilling, and risks such as displacement or bias. Interviewers listen for commercial awareness, empathy for affected workers, practical adaptation, and an understanding that AI usually transforms roles before it replaces them.
Ans. Read the question first, then the passage or sentence carefully. For grammar, check subject verb agreement, tense, articles, prepositions, modifiers, and parallel structure. For comprehension, identify the main idea, tone, and evidence in the text. Eliminate options that are extreme, irrelevant, or not supported by the passage.
Ans. Pick a real workplace scenario with pressure, ambiguity, or conflict, ideally one relevant to the role. Explain the context briefly, then focus on your judgement, actions, communication, and outcome. Emphasise accountability, calm decision making, and learning. Interviewers listen for practical problem solving, self-awareness, and behaviour that matches their values.
Ans. Work quickly by identifying the question type first: sequence, analogy, syllogism, arrangement, coding, or assumption. Use elimination before full calculation, mark difficult items, and return later. For arrangements, draw a small table or timeline. For syllogisms, test only what must be true. Accuracy matters, so avoid guessing too early.
Ans. Explain what the snippet outputs or renders, then justify it using JavaScript execution order or React rendering rules. Focus on scope, closures, hoisting, async behaviour, state updates, props, effects, and reconciliation. Mention side effects and edge cases. For performance, identify repeated work, data structures involved, and the resulting time and space complexity.
Ans. Method overloading means having multiple methods with the same name but different parameter lists in the same class, while method overriding means a subclass provides a new implementation of a superclass method with the same signature. Overloading is resolved at compile time. Overriding is resolved at runtime and supports polymorphism.
Ans. Use an ORDER BY on score in descending order, then return one row after skipping the first two rows, for example with LIMIT 1 OFFSET 2. This gives the third highest score, which is usually meant by the 3rd last score. If duplicate scores should count once, use DISTINCT or DENSE_RANK.
Ans. Use a structured approach: identify what is being asked, write down the given values, choose the relevant formula or arithmetic operation, and simplify step by step. For percentages, ratios, averages, profit, time, and speed, convert words into equations. Estimate first if possible, then calculate carefully and check whether the answer is reasonable.
Ans. OOPS is based on encapsulation, abstraction, inheritance and polymorphism to model data and behaviour as objects. Encapsulation hides internal state, abstraction exposes essentials, inheritance reuses and extends classes, and polymorphism lets one interface have many forms. Virtual functions enable runtime overriding. Friend functions can access private members without being class members.
Ans. Use an inner join to combine related tables, then apply aggregate functions with GROUP BY where needed. For example, join employees to departments, group by department name, and select MAX salary, MIN salary, and AVG salary. The key detail is that every non-aggregated selected column must be included in GROUP BY.
Ans. Memory management allocates, tracks and protects RAM for processes, while CPU scheduling decides which ready process runs next. Memory uses paging, segmentation, virtual memory and swapping to use limited RAM safely. Scheduling algorithms include FCFS, shortest job first, round robin and priority scheduling, balancing throughput, waiting time, response time and fairness.
Ans. Attempt the easiest questions first and avoid getting stuck. Spend about 45 seconds reading and planning, then solve or skip. Use approximation, elimination, percentage shortcuts, ratio methods and mental arithmetic where possible. Mark longer questions for review. Keep checking time after every five questions so you maintain pace and maximise total correct answers.
Ans. Diagonal clipping is distortion in diode detectors when the output cannot follow a rapidly falling modulated envelope. Modulation varies a carrier’s amplitude, frequency or phase to carry information. A triode is a three-electrode vacuum tube controlling current by a grid. Flip-flops are bistable digital circuits that store one bit.
Ans. Use JDBC by adding the database driver, opening a Connection with DriverManager using the JDBC URL, username and password, then creating a PreparedStatement to run SQL and reading results from a ResultSet. Use try-with-resources to close resources safely. No special data structure is needed, and connection setup is constant time apart from network and database latency.
Ans. Choose a real example where the disagreement was professional, not personal, and the outcome improved the work. Emphasise listening first, clarifying goals, using evidence, and staying respectful. Show you can challenge constructively, accept decisions, and support the final direction. Interviewers listen for maturity, collaboration, judgement, and low ego.
Ans. Sorting algorithms arrange data in a defined order, usually ascending or descending. Common types include comparison-based sorts such as bubble, insertion, selection, merge, quick and heap sort, and non-comparison sorts such as counting, radix and bucket sort. For general use, merge, quick and heap sort are better at O(n log n); counting or radix can be faster with limited input ranges.
Ans. The Diamond Problem is ambiguity caused when a class inherits the same method through two paths. Java avoids it by not allowing multiple class inheritance, but interface default method conflicts must be resolved by overriding. Compile-time polymorphism is method overloading resolved by the compiler. Runtime polymorphism is method overriding resolved by actual object type.
Ans. Abstraction can be shown with a Car object exposing start, accelerate, brake and stop, while hiding engine, fuel injection and braking details. The approach is to define only essential operations in a class or interface. No special data structure is required, and each operation is treated as constant time conceptually.
Ans. Identify the section first, then apply the standard method. For English, check grammar rules, vocabulary, context, and elimination. For analytical reasoning, map the data, use tables or diagrams, and test conditions logically. For quantitative aptitude, note given values, choose the right formula, simplify step by step, and verify with options.
Ans. Create a small banking program with an Account base class and SavingsAccount and CurrentAccount subclasses. Store accounts in a map keyed by account number for fast lookup. Use encapsulation for balance updates, inheritance for shared fields, polymorphism for withdrawal rules, and abstraction for common operations. Lookup, deposit, and withdrawal are average O(1).
Ans. Linear Regression predicts a continuous value, Logistic Regression predicts a class probability, and Random Forest predicts by combining many decision trees. Linear Regression fits a best line by minimising error, Logistic Regression uses a sigmoid or softmax for classification, and Random Forest reduces overfitting by averaging or voting across diverse trees.
Ans. A strong answer should describe a time you became productive with limited guidance. Emphasise clarifying priorities, reading documentation, asking focused questions, making reasonable assumptions, sharing progress, and seeking feedback early. Interviewers listen for independence, respect for others’ time, structured learning, communication, and willingness to deliver without needing constant supervision.
Ans. Use a min heap keyed by value and index, plus a doubly linked list of still-active positions. Pop the smallest active element, add its value to the sum, then mark it, its current left neighbour, and its current right neighbour as removed, relinking around them. Continue until no active elements remain. Time is O(n log n).
Ans. Pick the setting that honestly fits your work style, not the one you think sounds impressive. Emphasise adaptability, productivity, access to opportunities, and how you handle different environments. Interviewers listen for self-awareness, balance, and whether your preference affects relocation, teamwork, commuting, flexibility, or long-term commitment to the role.
Ans. Common Linux commands include ls to list files, cd to change directory, pwd to show the current path, cp to copy, mv to move or rename, rm to delete, mkdir to create directories, cat or less to view files, grep to search text, chmod to change permissions, ps and top to inspect processes, and man for help.
Ans. A Binary Search Tree is a binary tree where each node’s left subtree contains smaller values and its right subtree contains larger values. This ordering lets search, insert, and delete compare at each node and move left or right. Operations take O(h) time, which is O(log n) if balanced, but O(n) if skewed.
Ans. Records in a DBMS are sorted using the SQL ORDER BY clause. It can sort one or more columns in ascending or descending order, for example by name then date. The key detail is that indexes on the ordered columns can make sorting faster, while large unsorted results may require an expensive sort operation.
Ans. The main types of SQL joins are INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL OUTER JOIN, CROSS JOIN, and SELF JOIN. The key difference is how they handle unmatched rows: inner joins keep only matches, outer joins keep non-matching rows from one or both sides, and cross joins produce every combination.
Ans. I know arrays, linked lists, stacks, queues, hash tables, trees, heaps, graphs, tries and sets. The key difference is how they trade off access, insertion, deletion and search time. For example, hash tables give average constant-time lookup, while trees keep data ordered and graphs model relationships.
Ans. A RIGHT OUTER JOIN returns all rows from the right table and the matching rows from the left table. If there is no match in the left table, the left table’s columns are filled with NULL. It is equivalent to a LEFT JOIN with the table order reversed.
Ans. Use the expected sum of the full range and subtract the actual array sum; the difference is the missing number. For numbers 1 to n, expected sum is n times n plus 1 divided by 2. This uses no extra data structure, runs in O(n) time, and O(1) space.
Ans. Pick a simple, familiar topic where you can make one clear point, not something complex or controversial. Structure it with a brief opening, two or three supporting points, and a concise close. Emphasise clarity, calm pace, and relevance. Interviewers listen for organised thinking, confidence, communication under pressure, and staying within time.
Ans. Use an INNER JOIN by selecting columns from the first table, joining the second table, and matching related keys in the ON condition, such as customer id in both tables. The important detail is that it returns only rows where the join condition matches in both tables, excluding unmatched rows.
Ans. Bubble Sort repeatedly compares adjacent elements and swaps them if they are in the wrong order until the array is sorted. Use the array in place, scanning from left to right, with each pass moving the largest remaining element to the end. Its time complexity is O(n²) and space complexity is O(1).
Ans. Use a hash set to track values already seen, and build a new array only with elements encountered for the first time. This preserves the original order of unique elements. The time complexity is O(n), and the extra space complexity is O(n).
Ans. The syntax is to select columns from one table, use INNER JOIN with the second table, and specify the matching condition with ON. In SQL form, it is: SELECT columns FROM table1 INNER JOIN table2 ON table1.column = table2.column. It returns only rows where the join condition matches in both tables.
Ans. Inheritance is an OOP concept where one class, called a child or subclass, derives fields and behaviour from another class, called a parent or superclass. It models an “is a” relationship, reduces duplication, and allows specialised classes to extend or override inherited behaviour while still being usable polymorphically.
Ans. Docker is a platform for packaging and running applications in lightweight containers. A container includes the application, its libraries, dependencies and configuration, so it behaves consistently across different machines. Its main purpose is to make software easier to build, ship and run reliably in development, testing and production environments.
Ans. C is mainly a procedural systems programming language, while C++ extends C with object oriented and generic programming features. The key practical difference is that C++ provides classes, constructors, destructors, templates and a richer standard library, enabling abstractions such as RAII and containers while still supporting low level memory control.
Ans. Object-Oriented Programming is a programming style that organises software around objects, which combine data and behaviour. Objects are usually created from classes. The key idea is encapsulation: keeping state and the operations on that state together, with controlled access. OOP also commonly uses abstraction, inheritance and polymorphism.
No question matches those filters. Reset filters.
Showing 60 of 179 questions. Ranked by how often the same question came back across interviews.
A spoken interview built from these questions, scored when you finish; the feedback is yours.
Start practisingWhen you are ready, record The One: a single interview hiring teams watch, so you stop repeating first rounds.
Candidate interviews most often cover CS fundamentals (53%) and DSA (28%).
Candidate interviews show an average of 4.4 rounds per experience, with a typical sequence of Online test → Online test → Technical → HR. Individual interview paths can vary.
Among questions with a recorded difficulty, the mix is easy 78%, medium 22%, hard 0%.
