i
OpenText Technologies
Filter interviews by
I appeared for an interview in Aug 2021.
Round duration - 90 minutes
Round difficulty - Medium
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.
The ...
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.
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
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
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
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Maintain a clean resume and have in-depth knowledge of the projects, as in the technical round the interviewer mainly asks technical questions regarding the projects. Questions based on projects are predictable and answering them can give a good impression during the interview.
Tip 2 : Be clear in explaining the approach to coding questions.
Tip 3 : Admit it, if you are not confident in a particular topic. Accepting your weakness is better than a wrong answer.
Tip 1 : Use formal resume templates and maintain a neat resume.
Tip 2 : Have few development projects on the resume with brief summary of the skills implemented.
Tip 3 : Mention your skills in proper sub-sections.
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
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.
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.
Create a boolean array of size 100 and mark the present numbers
Iterate through the boolean array and find the missing numbers
Alternatively, use a HashSet to store the present numbers and find the missing ones
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
I applied via Campus Placement
I applied via Referral
Software Engineer
994
salaries
| ₹6.3 L/yr - ₹26 L/yr |
Senior Software Engineer
912
salaries
| ₹12 L/yr - ₹36 L/yr |
Lead Software Engineer
385
salaries
| ₹16 L/yr - ₹50 L/yr |
Associate Software Engineer
367
salaries
| ₹6.8 L/yr - ₹12 L/yr |
Software Developer
233
salaries
| ₹5.7 L/yr - ₹22.9 L/yr |
Amdocs
Automatic Data Processing (ADP)
24/7 Customer