i
OpenText Technologies
Filter interviews by
I applied via campus placement at Kalinga Institute of Industrial Technology, Khurda and was interviewed in May 2024. There were 2 interview rounds.
Coding round was there. Two coding questions were asked to solve in 1 hour. The difficulty was easy to medium.Leetcode questions of arrays and strings.
posted on 17 Apr 2024
I applied via Campus Placement
Coding based on dsa
I applied via Campus Placement
Two medium hackerrank questions
OpenText Technologies interview questions for designations
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Mar 2023. There were 3 interview rounds.
1 HOURS , 2 QUESTIONS
I applied via Company Website and was interviewed in Jan 2022. There were 4 interview rounds.
After resume shortlisting we had aptitude + coding test .it was an online test with only one coding question. The question was of easy to medium level mostly from array's.
Top trending discussions
I applied via campus placement at Dayananda Sagar College of Engineering, Bangalore and was interviewed in Oct 2024. There were 4 interview rounds.
3 coding dsa question
Difficulty is On your luck
My friends got easy level
I got medium level
Some got hard questions as well
Ssh round , quant and logical
Tip: bring your calculator
OnCampus Test including DSA Questions
I was interviewed in Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
We want to assign N number of subjects among K friends. So consider this as dividing the array into K partitions, where each partition denotes the subjects assigned to one of the friends. Assume that we already have K-1 partitions i.e. we have already assigned the subjects to K-1 friends, and now we want to do the K th partition. So, this last divider can be put between i th and i+1 th subject for 1<=i<...
Given an array of integers, determine the sum of bit differences among all possible pairs that can be formed using the elements of the array.
The b...
O(1)
No extra space is required.
Time Complexity: O(n^2)Explanation:O(N^2), where ‘N’ is the number of elements in the given integer array.
We have to run two nested loops to get every pair that can be formed using the given array ele...
Round duration - 60 minutes
Round difficulty - Medium
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:LCM(1, N) + LCM(2, N) + ....
Using the mathematical formula, A*B = LCM(A,B) * GCD(A,B) where ‘A’ and ‘B’ are the two integers, and GCD(A,B) denotes the Greatest common divisor of ‘A’ and ‘B’.
For example, suppose
A = 20 and B = 30
Factors of A = {1,2,4,5,10,20}
Factors of B = {1,2,3,5,6,10,15,30}
The greatest common factor is 10, hence GCD(20,30) = 10.
So LCM(A,B) = A*B / GCD(A,B)
All we need to fin...
Given a 9x9 Sudoku board, your task is to fill the empty slots and return the completed Sudoku solution.
A Sudoku is a grid composed of nine 3x3 smaller grids. The challenge is to fill in the...
Our approach here will be to check for each empty slot that filling it with which number will not violate any constraint. We will start from the first block and keep on checking for each block using recursion. Consider a function SOLVESUDOKU for this, that accepts as a parameter an ArrayList ARR and do:
Round duration - 60 minutes
Round difficulty - Hard
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Approach:
We need to delete the node K from the linked list. The most general way to delete the node K from a singly linked list is to get access to the previous node of K. We can get access to the previous node by traversing from the head of the linked list. Let’s denote this previous node as P. Then, we update the next pointer of P to the next pointer of K.
Although the reference to node K is giv...
Round duration - 60 Minutes
Round difficulty - Easy
Timing was around 3 pm.
Given an array ARR
consisting of N
integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
We will iterate through all possible boundaries of the subarrays in the given array with the help of two nested loops.
Then, we will iterate through each subarray with the help of another loop and find the sum of the subarray. We will maintain the maximum subarray sum through our iterations and finally return it.
Space Complexity: O(1)Explanation:O(1), constant space is used.
Time Complexity: O(n^3...Tip 1 : Practice on white board
Tip 2 : Spend daily some time
Tip 3 : Practice previous questions
Tip 1 : Resume should be short and neat
Tip 2 : Keep only thing in which you are sure you will answer all questions
I was interviewed in Jan 2021.
Round duration - 150 minutes
Round difficulty - Medium
It was an online round consisting of 2 programming questions restricted to C++, Java, and C# and 10 MCQ's on Data structures, Algorithms, etc..
You are given two integers DAY_HOURS
and PARTS
. Consider a day with DAY_HOURS
hours, which can be divided into PARTS
equal parts. Your task is to determine the total ins...
Round duration - 60 minutes
Round difficulty - Easy
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
Tip 1 : Practice Data Structures and Algorithms.
Tip 2 : Practice Puzzles from GFG.
Tip 3 : Should have good knowledge of OOPS.
Tip 1 : Have some good projects on your resume.
Tip 2 : Do not anything false in your resume.
Tip 3 : Mention your coding profiles in your resume.
Some of the top questions asked at the OpenText Technologies Software Developer Intern interview -
based on 5 interviews
2 Interview rounds
based on 5 reviews
Rating in categories
Software Engineer
964
salaries
| ₹6.2 L/yr - ₹26 L/yr |
Senior Software Engineer
901
salaries
| ₹12 L/yr - ₹36 L/yr |
Associate Software Engineer
353
salaries
| ₹4.6 L/yr - ₹16 L/yr |
Lead Software Engineer
330
salaries
| ₹16.5 L/yr - ₹50 L/yr |
Software Developer
216
salaries
| ₹5.5 L/yr - ₹20.1 L/yr |
TCS
Infosys
Wipro
HCLTech