OpenText Technologies Software Developer Intern Interview Questions and Answers

2 coding question were there and we need to solve eit in 45 minutes

• Q1. Asked a DSA questions
  Add Answer
• Q2. Some random question about project.
  Add Answer

OnCampus Test including DSA Questions

• Q1. Introduce yourself
  Add Answer
• Q2. DSA Question based on Dynamic Programming
  Add 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 con...read more
  Add Answer
• Q2. Technical Questions

  1. Dynamic memory allocation for 2d array
  2. How polymorphism works in C++(Vptr and Vtable implementation)
   

  Add 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 whi...read more
  View Answers (2)
• 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 re...read more
  Add 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 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 sta...read more
  View Answers (1)

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. S...read more
  View Answers (1)
• 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 rotat...read more
  View Answers (2)