OpenText Technologies Full Stack Engineer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Find All Subsets
Given an array arr consisting of 'N' distinct integers, your task is to generate all possible non-empty subsets of the given array.
You can return the subsets in any order.
Input:
The ...read more
Ans. 
Generate all possible non-empty subsets of a given array of distinct integers.
• Use recursion to generate all subsets by including or excluding each element in the array.

• Maintain a current subset and iterate through the array to generate subsets.

• Print each subset as it is generated to get all possible non-empty subsets.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The technical question was mainly based on my resume, followed by coding questions.

Round duration - 30 Minutes
Round difficulty - Easy

It was a coding round

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Keep track of the current, previous, and next nodes while traversing the linked list.

• Update the head of the reversed linked list to be the last node encountered.

• Ensure to handle edge cases like an empty linked list or a s
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy