Hussain Engineering Services Interview Questions and Answers

Yes, I am comfortable with night shifts as I have prior experience and can adjust my schedule accordingly.

• I have worked night shifts in my previous job and have adapted to the schedule

• I am willing to adjust my sleep and meal timings to accommodate the night shift

• I understand the importance of being alert and focused during night shifts

• I have no personal commitments that would hinder my ability to work night shifts

BPO focuses on business processes while KPO focuses on knowledge-based processes.

• BPO involves outsourcing of non-core business processes like customer support, HR, and accounting.

• KPO involves outsourcing of knowledge-based processes like research and development, data analysis, and market research.

• BPO is more transactional in nature while KPO requires specialized skills and expertise.

• BPO is generally considered to be a...read more

My future plans include gaining experience and expertise in my field, taking on leadership roles, and contributing to the growth of the company.

• I plan to work hard and learn as much as possible in my role as an executive trainee

• I hope to take on leadership roles within the company as I gain experience and expertise

• I want to contribute to the growth and success of the company through my work and ideas

I have a passion for a different field and want to explore my own potential.

• I have always been interested in this field and want to pursue it as a career.

• I want to explore my own potential and create my own identity.

• I believe in following my own dreams and passions rather than someone else's.

• I have a different skill set and want to utilize it in a different field.

• I want to gain experience and knowledge in a different i...read more

I have the necessary skills, experience, and passion to excel in this role.

• I have relevant experience in the field

• I possess the required skills and qualifications

• I am a quick learner and adaptable to new situations

• I am passionate about the industry and eager to contribute

• I am a team player and work well with others

Find sum of all numbers formed from root to leaf path in a binary tree

• Traverse the binary tree using DFS

• At each leaf node, add the number formed from root to leaf path to a sum variable

• Return the sum variable

• Time complexity: O(n)

• Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25

Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.

• Use recursion to generate all possible combinations of spaces

• For each recursive call, either add a space or don't add a space between the current character and the next character

• Base case is when there are no more characters left to add spaces between

• Time complexity is O(2^n) where n is the length of the string

Preorder traversal without recursion

• Use a stack to keep track of nodes

• Push right child first and then left child onto stack

• Pop top of stack and print value

• Repeat until stack is empty

Find longest continuous patch on a 12 km road with updates in patches

• Maintain a variable to keep track of current patch length

• Update the variable whenever a new patch is added

• Maintain a variable to keep track of longest patch so far

• Compare current patch length with longest patch length and update if necessary

• Use a sorted data structure like a binary search tree to store the patches for efficient search

• Time complexity: ...read more

Find median of an unsorted array.

• Sort the array and find the middle element

• Use quickselect algorithm to find the median in O(n) time

• If the array is small, use brute force to find the median

Find 'k' elements closest to a given number from a stream of characters.

• Use a priority queue to keep track of closest elements.

• Update the queue as new characters come in.

• Return the 'k' closest elements from the queue.

Design a data structure with O(1) insert, remove, find-max, and delete-max operations.

• Use a doubly linked list to maintain the elements in sorted order.

• Use a hash table to store the pointers to the nodes in the linked list.

• Maintain a pointer to the maximum element in the hash table.

• Update the pointers in the hash table when inserting or removing elements.

• Update the maximum pointer when deleting or inserting the maximum

Check if a given linked list is a palindrome.

• Traverse the linked list and store the values in an array.

• Compare the first and last elements of the array, then move towards the center.

• If all elements match, the linked list is a palindrome.

• Alternatively, use two pointers to find the middle of the linked list and reverse the second half.

• Compare the first half with the reversed second half to check for a palindrome.