i
OpenText
Technologies
Filter interviews by
Java program to reverse a string using StringBuilder
Create a StringBuilder object with the input string
Use the reverse() method of StringBuilder to reverse the string
Convert the reversed StringBuilder object back to a string using toString()
Java program using hash map to find highest and lowest marks
Create a hash map to store student names and their marks
Iterate through the hash map to find the highest and lowest marks
Use a variable to keep track of the highest and lowest marks
I applied via Company Website and was interviewed in Jan 2023. There were 6 interview rounds.
Exam in codility portal and it is toughest exam. Have to prepare Basics of Java.. it will help in creating logics.
Top trending discussions
I applied via Approached by Company and was interviewed before Jun 2021. There were 2 interview rounds.
Frameworks provide structure and pre-built components for software development, but can also limit flexibility and require learning curve.
Advantage: Provides structure and pre-built components for faster development
Advantage: Can improve code quality and maintainability
Disadvantage: Can limit flexibility and customization
Disadvantage: Requires learning curve and potential dependency issues
Example: ReactJS provides a fr...
Oops stands for Object-Oriented Programming. It is a programming paradigm that uses objects to represent real-world entities.
Advantages: code reusability, modularity, encapsulation, inheritance, polymorphism
Disadvantages: complexity, steep learning curve, performance overhead
Example: creating a class 'Car' with properties like 'make', 'model', and 'year', and methods like 'start_engine' and 'stop_engine'
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Numerical and logical aptitude test
There are 5 rounds on datastructure and algorithm
I appeared for an interview before Nov 2020.
Round duration - 45 minutes
Round difficulty - Medium
The interview was with a Korean employee.
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...
Find all the bridges in an undirected graph.
Use Tarjan's algorithm to find bridges in the graph.
A bridge is an edge whose removal increases the number of connected components.
Check for bridges by removing each edge and checking the number of connected components.
Return the edges that are bridges in non-decreasing order.
Round duration - 45 Minutes
Round difficulty - Medium
Interviewer was an Indian employee.
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindrome with the smallest start index
Round duration - 45 Minutes
Round difficulty - Hard
Interviewer was an Indian employee.
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...
Given a sorted alien dictionary in an array of strings, determine the character order of the alien language.
Iterate through the words in the dictionary to build a graph of character dependencies.
Perform a topological sort on the graph to determine the character order.
Return the character order as a list of characters.
Round duration - 45 Minutes
Round difficulty - Hard
Interviewer was an Indian employee.
The Ninja has a robot which navigates an infinite number line starting at position 0 with an initial speed of +1. The robot follows a set of instructions which includes ‘A’ (Acceler...
Determine the minimum length of instruction sequence for a robot to reach a given target on an infinite number line.
Start at position 0 with speed +1, update position and speed based on 'A' and 'R' instructions
For each test case, find the shortest sequence of instructions to reach the target
Consider both positive and negative positions for the robot
Tip 1 : Do competitive coding in 1st and 2nd year.
Tip 2 : Practice basic questions before starting complex problem.
Tip 3 : Start doing mock interviews from the end of 5th semester. It gives a lot of confidence.
Tip 1 : Adding competitive programming ranks add value.
Tip 2 : You should have some good project which you can explain nicely.
I applied via LinkedIn and was interviewed before Apr 2021. There were 2 interview rounds.
It was quite good
Assignment was real world based
I applied via Company Website and was interviewed in Feb 2022. There were 2 interview rounds.
5 or 6 questions from algo and coding
I applied via Company Website and was interviewed in Dec 2020. There was 1 interview round.
Time complexity measures the amount of time an algorithm takes to complete based on input size.
Time complexity is expressed using Big O notation (e.g., O(n), O(log n)).
O(1) indicates constant time, e.g., accessing an array element.
O(n) indicates linear time, e.g., iterating through an array.
O(n^2) indicates quadratic time, e.g., nested loops through an array.
O(log n) indicates logarithmic time, e.g., binary search in a...
Some of the top questions asked at the OpenText Technologies Senior Quality Assurance Engineer interview -
based on 3 interview experiences
Difficulty level
Duration
based on 12 reviews
Rating in categories
Software Engineer
1.1k
salaries
| ₹12 L/yr - ₹21 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹22.2 L/yr - ₹40 L/yr |
Associate Software Engineer
412
salaries
| ₹7.9 L/yr - ₹13 L/yr |
Lead Software Engineer
374
salaries
| ₹29.5 L/yr - ₹52 L/yr |
Software Developer
261
salaries
| ₹10.9 L/yr - ₹20 L/yr |
Amdocs
Automatic Data Processing (ADP)
24/7 Customer