i
OpenText Technologies
Filter interviews by
I applied via Approached by Company and was interviewed in Jan 2023. There were 5 interview rounds.
Two moderate level question were there. Needed to solve in 1 hr. Very much solvable if you know data structure. This was the screening process after the resume shortlisting.
Again 2 questions needed to solve in 1 hr (very similar to first screening round)
I applied via LinkedIn and was interviewed before Apr 2021. There were 4 interview rounds.
Hacker Rank test. Will give 2 programs.
Top trending discussions
I applied via Company Website and was interviewed in Feb 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed before Oct 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 120minutes
Round difficulty - Easy
It was an online MCQ's + coding round consisting of 20 MCQ’s and 1 coding problem.
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at double the speed of the other.
If there is a loop, the two pointers will eventually meet at the same node.
Example: 1 -> 2 -> 3 -> 4 -> 5 -> 2 (loop back to 2), the two pointers will meet at node 2.
Round duration - 50 minutes
Round difficulty - Easy
The interview started at 8:30 pm in cc of Delhi Technological University itself and it was quite late. There was only a single interviewer and he asked me one coding question related to overflow of integers.
To check for integer overflow when multiplying two integers, use the properties of integer overflow and check if the result is within the valid range of the integer type.
Check if the signs of the two integers are the same to avoid overflow in case of multiplication.
Use the properties of integer overflow to detect if the result exceeds the maximum or minimum value of the integer type.
Consider using a larger data type or...
Round duration - 15 minutes
Round difficulty - Easy
It was quite late . There was only one interviewer and I was asked about my family , education and future plannings and few questions related joining locations and documents etc.
Focus on data structures and algorithms part more. Tell the interviewer , starting from the brute force approach to the most optimal solution as this will give a good impression to the interviewer.
Application resume tips for other job seekersTo be honest, the problem-solving ability is the only thing that most companies care about. So you can manipulate your resume according to that. Mention your competitive programming handles in your resume and also other coding ranks or achievements which you have achieved.
Final outcome of the interviewSelectedI applied via Company Website and was interviewed before Sep 2020. There were 3 interview rounds.
I appeared for an interview in Jan 2021.
Merge sort and Quick sort are sorting algorithms while Fibonacci is a sequence of numbers.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half and then merges them.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot.
Fibonacci is a sequence of numbers where each number is the sum of the two precedin...
Some of the top questions asked at the OpenText Technologies Senior Software Developer interview -
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Software Engineer
995
salaries
| ₹6.5 L/yr - ₹26 L/yr |
Senior Software Engineer
924
salaries
| ₹12 L/yr - ₹36 L/yr |
Lead Software Engineer
375
salaries
| ₹16 L/yr - ₹50 L/yr |
Associate Software Engineer
371
salaries
| ₹6.8 L/yr - ₹17 L/yr |
Software Developer
233
salaries
| ₹5.7 L/yr - ₹22.9 L/yr |
Amdocs
Automatic Data Processing (ADP)
24/7 Customer