OpenText Technologies Software Developer Intern Interview Questions and Answers

OnCampus Test including DSA Questions

Q1. Introduce yourself
Add your answer
Q2. DSA Question based on Dynamic Programming
Add your answer

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..

Q1. Prime Time Again
You have been given two integers ‘DAY_HOURS’ and ‘PARTS’. Where ‘DAY_HOURS’ is the number of hours in a day and a day can be divided into ‘PARTS’ equal parts. Your task is to find total in...read more
Ans. Brute Force
• This is a Naive/Brute Force approach
• Create a 2-d array of size ‘P’ rows and ‘D/P’ columns and assign 1 to ‘D’ value in each cell.
• Take an example with ‘D’ being 12 and ‘P’ being 2, then create an array [  [1,2,3,4,5,6]  [7,8,9,10,11,12]  ]
• Keep track of the number of prime group instances using a ‘PRIME_GROUP’ variable, which would be initialized to 0.
• We can easily observe that each column in th...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 60 minutes
Round difficulty - Easy

Q1. Puzzle
There is a room with a door (closed) and three light bulbs. Outside the room, there are three switches, connected to the bulbs. You may manipulate the switches as you wish, but once you open the door...read more
Add your answer
Q2. Third greatest element
Given an array/list 'ARR' of ‘N’ distinct integers, you are supposed to find the third largest element in the given array 'ARR'.
Input Format :
The first line conta...read more
Ans. Sorting Based Approach
The idea is to sort the array in non-decreasing order, and then return the third element from the back of the array.
 
The steps are as follows :
1. Sort the array in non-decreasing order.
2. Return the third element from the back of the array.
Space Complexity: O(logn)Explanation:
O(1)
 
We are not using any extra space. Thus, the overall space complexity will be O(1).
Time Complexity: O(nlogn)Explan...read more
Answered by CodingNinjas
View 2 more answers
Q3. OOPS Questions
Basic concepts on OOPS was asked like:
Friend Function
Inheritance
Polymorphism
Abstraction
Encapsulation.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Technical Questions
This round was mainly based on my Projects and Tech Stack I used in my Projects.
Add your answer
Q2. OOPS Questions
Basic concepts of OOPS were asked like Inheritance, Polymorphism, Abstraction, and Encapsulation.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Basic HR Questions
What are your hobbies? or What are you passionate about? 
What are your biggest achievements till date? 
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

It was a telephonic round. The interview asked me these questions.
 

Q1. Puzzle
You have two ropes coated in oil to help them burn. Each rope will take exactly 1 hour to burn all the way through. However, the ropes do not burn at constant rates—there are spots where they burn a ...read more
Add your answer
Q2. Technical Questions
1. Dynamic memory allocation for 2d array
2. How polymorphism works in C++(Vptr and Vtable implementation)
 
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer started asking me questions. He gave me 2 problems. He was giving hints in case of any issues.
 

Q1. Maximum Frequency Number
Ninja is given an array of integers that contain numbers in random order. He needs to write a program to find and return the number which occurs the maximum times in the given inpu...read more
Ans. Brute Force Approach
Here, we can simply run two loops. The outer loop picks all elements one by one and the inner loop finds the frequency of the picked element and compares it with the maximum present so far.
 
Algorithm:
 
• Declare 4 variables as ‘maxFrequency’ , ‘currentFrequency’ , ‘maxElement’ , ‘currentElement’ and initialize them with 0
• Run a loop from ‘i’ = ‘0’ to ‘N’
  • Set ‘currentElement’ as arr[i] and ‘curr...read more
Answered by CodingNinjas
View 1 more answer
Q2. System Design Question
There is an online catalog of songs (Like Saavn or Gaana). How you will show favorite songs every day to users. An efficient algorithm required. (K max solution/ Min heap solution)
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was a technical interview. He gave me these questions one by one.
1. Again, how polymorphism works. Draw vtable and vptr
2. Producer consumer problem with synchronization
3. Difference between mutex, semaphore, and condition_variable.
4. Design parking lot system
5. Zigzag traversal of binary tree

Q1. System Design Question
Design parking lot system
Add your answer
Q2. Zigzag Binary Tree Traversal
Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from left to right, then right to left ...read more
Ans. Iterative Approach
Our very basic intuition is that we are going to traverse the given binary tree using level order traversal where we just need to modify one thing that for every alternate level we need to reverse the order that level. 
 
Steps are as follows:
 
1. Create an empty queue.
2. For each node, first, the node is visited and then it’s child nodes are added in the queue if they exist(First in first out).
3. ...read more
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

1. He asked about the producer-consumer problem but I told him that the same question is asked in the previous round.
Then interviewer went asking lots of questions related to producer and consumer. Lots of discussions like what is a writer is not there and the only reader is there and you need to find out how many readers are currently reading from the buffer.
2. Discussions about C++11 features. How thread and async is different
3. Design your own shared_ptr(How you will handle ownership)
4. Check If the binary tree is symmetrical.
5. Find elements in a rotated sorted array and then optimize it.

Q1. Tree Symmetricity
You are given a binary tree, where the data present in each node is an integer. You have to find whether the given tree is symmetric or not.
Symmetric tree is a binary tree, whose mirro...read more
Ans. Inorder And Reverse Inorder
We do two inorder traversals recursively of the tree simultaneously. For the first traversal, we traverse the left child first and then the right child, and in the second traversal, we traverse the right child first and then the left child. Let cur1 and cur2 be the current nodes of the first and second traversals respectively and initially both of them are passed as root. Then the algorithm f...read more
Answered by CodingNinjas
Add your answer
Q2. Search In Rotated Sorted Array
You have been given a sorted array/list ARR consisting of ‘N’ elements. You are also given an integer ‘K’.
Now the array is rotated at some pivot point unknown to you. For ...read more
Ans. Naive Approach
Naively traverse the array and find if ‘K’ is present in ARR or not. If ‘K’ is present in ARR return its index else return -1.
Space Complexity: O(1)Explanation:
O(1), i.e. constant space complexity. 
Time Complexity: O(n)Explanation:
O(N), where N is the length of the array/list. 
 
We are iterating over the array/list ARR once. Hence, the time complexity is O(N).

Java (SE 1.8)

/*

    Time Compl...read more
Answered by CodingNinjas
View 1 more answer