AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
OpenText Technologies
Compare
Filter interviews by
OpenText Technologies Senior Quality Assurance Engineer Interview Questions and Answers
OpenText Technologies Senior Quality Assurance Engineer Interview Experiences
2 interviews found
Selected
(1 Question)
- Q1. Java program to reverse a string
- Ans.
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()
(1 Question)
- Q1. Java program to get highest and lowest marks using hash map
- Ans.
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
(1 Question)
- Q1. Scenario based questions
Skills evaluated in this interview
Selected
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.
(1 Question)
- Q1. In Technical round 01.. we have to solve coding questions(more than 2) and that have to drafted in a notepad or in online editor. They are conscious on prompts for next steps. After that, They will ask Ja...
(1 Question)
- Q1. In Technical round 2, have to solve coding questions(more than 3)in notepad and execute in online editor(getting proper output is must). they will ask on Java theory questions more deep, GIT, defect cycle...
(1 Question)
- Q1. This is face to face round(can be virtual as well), They will ask technical questions and they will give program to execute. They will ask us to explain codility exam program to explain and execute in live...
(1 Question)
- Q1. Once all 4 rounds are done then we will chance to attend this, They will explain roles and responsibilities of the particular role. Then they will shoot one more Technical question or one coding question ...
(1 Question)
- Q1. They will check all round results and shoot some Managerial questions and behavioral questions. if they are satisfied then they will release offer.
Interview questions from similar companies
Interview Questionnaire
1 Question
- Q1. Computer networking, oops, programming
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
The test included MCQ questions from SQL, Linux Commands, C/C++ programming, Logical Reasoning, Aptitude questions. The other section was the coding round, where 2 SQL queries and 2 coding questions were there.
- Q1.
Subarray with Equal Occurrences Problem Statement
You are provided with an array/list
ARRof lengthNcontaining only 0s and 1s. Your goal is to determine the number of non-empty subarrays where the numbe... - Ans.
Count the number of subarrays where the number of 0s is equal to the number of 1s in a given array of 0s and 1s.
Iterate through the array and keep track of the count of 0s and 1s encountered so far.
Use a hashmap to store the count of 0s and 1s encountered at each index.
For each index, check if the count of 0s is equal to the count of 1s encountered so far and update the result accordingly.
- Q2.
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.
Input:
The first lin... - Ans.
Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.
Iterate through all possible triplets of numbers in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of two numbers is equal to the square of the third number for each trip...
(3 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was a standard DSA round where I was asked to solve 2 questions and also code it in a production ready manner . At the end I was also asked some questions related to Linux and SQL . I was tested on some basic commands of Linux .
- Q1.
Palindromic Substrings Problem Statement
Given a string
S, your task is to return all distinct palindromic substrings of the given string in alphabetical order.Explanation:
A string is considered a pal...
- Ans.
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string.
Check if each substring is a palindrome.
Store distinct palindromic substrings in alphabetical order.
- Q2.
Swap Two Numbers Problem Statement
Given two integers
aandb, your task is to swap these numbers and output the swapped values.Input:
The first line contains a single integer 't', representing the num... - Ans.
Swap two integers 'a' and 'b' and output the swapped values.
Create a temporary variable to store one of the integers before swapping.
Swap the values of 'a' and 'b' using the temporary variable.
Output the swapped values of 'a' and 'b'.
- Q3. What is meant by normalization and denormalization?
- Ans.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity, while denormalization is the process of intentionally adding redundancy to improve query performance.
Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy and dependency.
Denormalization involves combining tables or adding redundant data to...
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a DS/Algo + Core round where I was asked questions related to DBMS , SQL queries and Linux Commands . The first question was of DSA and I was able to code it preety fast . I was also asked to execute some SQL queries on my laptop.
Overall , this round went good according to my opinion.
- Q1.
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
- Ans.
Check if two strings are anagrams of each other by comparing their sorted characters.
Sort the characters of both strings and compare them.
Use a dictionary to count the frequency of characters in each string and compare the dictionaries.
Ensure both strings have the same length before proceeding with comparison.
Handle edge cases like empty strings or strings with different lengths.
- Q2. How would you delete duplicate emails from a database using SQL?
- Ans.
Use SQL query with GROUP BY and HAVING clause to delete duplicate emails from a database.
Use GROUP BY clause to group emails together
Use HAVING clause to filter out groups with more than one email
Use DELETE statement to remove duplicate emails
- Q3. What is the difference between the DELETE and TRUNCATE commands in a DBMS?
- Ans.
DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.
DELETE is a DML command, while TRUNCATE is a DDL command.
DELETE can be rolled back, while TRUNCATE cannot be rolled back.
DELETE triggers ON DELETE triggers, while TRUNCATE does not trigger any triggers.
DELETE is slower as it maintains logs, while TRUNCATE is faster as it does not maintain logs.
Example: DELETE FRO...
(2 Questions)
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions .
- Q1. What is something about you that is not included in your resume?
- Q2. Why do you want to work at Amdocs?
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Senior Software Engineer Interview Questions & Answers
Thomson Reuters
Anonymous
posted on 8 Apr 2022
I applied via Naukri.com and was interviewed before Apr 2021. There were 3 interview rounds.
Aptitude test will a hackerrank test where it might have technical MCQ and/or coding test.
(1 Question)
- Q1. Interviewer will test your logic building capability with puzzel/coding and technical questions and experience discussion.
(1 Question)
- Q1. Its a normal discussion with HR about CTC and all.
Interview Preparation Tips
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DBMS.
- Q1. What is data integrity?
- Ans.
Data integrity refers to the accuracy, consistency, and reliability of data throughout its lifecycle.
Data integrity ensures that data is accurate and consistent in storage and transmission.
It involves maintaining the quality and reliability of data over time.
Methods for ensuring data integrity include checksums, encryption, and error detection codes.
Examples of data integrity violations include data corruption, unautho
- Q2. What is a trigger in the context of a database management system?
- Ans.
A trigger is a special type of stored procedure that automatically executes when certain events occur in a database.
Triggers are used to enforce business rules, maintain data integrity, and automate repetitive tasks.
They can be triggered by INSERT, UPDATE, or DELETE operations on a table.
Examples of triggers include auditing changes to a table, updating related tables when a record is modified, or enforcing referential
- Q3. What is the difference between clustered and non-clustered indexes in a database management system?
- Ans.
Clustered indexes physically order the data in the table, while non-clustered indexes do not.
Clustered indexes determine the physical order of data in the table, while non-clustered indexes do not.
A table can have only one clustered index, but multiple non-clustered indexes.
Clustered indexes are faster for retrieval of data, especially range queries, compared to non-clustered indexes.
Non-clustered indexes are stored se...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions on DBMS.
- Q1. What is the difference between UNION and UNION ALL in SQL?
- Ans.
UNION combines and removes duplicates, UNION ALL combines without removing duplicates.
UNION merges the result sets of two or more SELECT statements and removes duplicates.
UNION ALL merges the result sets of two or more SELECT statements without removing duplicates.
UNION is slower than UNION ALL as it involves removing duplicates.
Example: SELECT column1 FROM table1 UNION SELECT column1 FROM table2;
Example: SELECT column...
- Q2. What are the functions of a cursor in PL/SQL?
- Ans.
A cursor in PL/SQL is used to retrieve and process multiple rows of data one at a time.
Allows iteration over a result set
Retrieves data row by row
Can be used to update or delete rows in a table
Must be declared, opened, fetched, and closed
- Q3. Write a SQL query to fetch the nth highest salary from a table.
- Ans.
SQL query to fetch the nth highest salary from a table
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to fetch the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
This was a managerial round with typical behavioral problems.
Interview Preparation Tips
Tip 1 : Since this was a SQL post, I would suggest you to get the basics intact and try practicing few queries.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. Questions on java8
- Q2. Questions on multithreading
- Q3. Questions on exception handling
Interview Preparation Tips
Interview Questionnaire
16 Questions
- Q1. Simple linked list questions-find middle element,given a pointer to second last element delete it
- Q2. Explain insertion sort,quicksort
- Ans.
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
- Q3. Concept of virtual destructors,runtime polymorphism
- Q4. Test cases for an installation software like check if sufficient memory available,check for a previous version,check to undo all the changes made to the system while quitting the installation. 5.2 puzzles
- Q5. Merge two sorted linked lists using recursion
- Ans.
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
- Q6. Given an integer(consider 4 bytes) find which byte is zero
- Ans.
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
- Q7. Program to check whether your machine is little endian or big endian
- Ans.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
- Q8. Print something before execution of main()(use static objects)
- Ans.
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
- Q9. Memory allocation for static varibles(when,which segment etc)
- Ans.
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
- Q10. Find space and time complexity for a recursive function(he wrote it)
- Ans.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
- Q11. Some questions on major project
- Q12. Preprocessor directives,volatile keyword
- Q13. Virtual pointer table,operator overloading,friend functions,semaphores
- Q14. Diamond heirarchy problem
- Ans.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
- Q15. Fibonacci series.(:P)
- Q16. Puzzle
Interview Preparation Tips
Experience: 1. Aptitude-Mostly caselets on ordering and some easy quant questions.
2. c/c++-No objective questions.Mostly on basics(function pointers,give output of string based codes).Some simple progams(Find smallest of three numbers using conditional operators.gcd using recursion)
3.Data Structures-LCA for BST,2's compliment,reverse a doubly linked list.
College Name: NA
Skills evaluated in this interview
Interview Questionnaire
20 Questions
- Q1. He asked me my specialization?
- Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
- Q3. He asked me to tell him about my favorite project
- Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
- Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
- Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
- Ans.
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
- Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
- Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
- Q9. Which are the four storage classes in C
- Ans.
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
- Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
- Ans.
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
- Q11. Question on polymorphisms
- Q12. He again went back to the first question he had asked me. Once again
- Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
- Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
- Ans.
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
- Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
- Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
- Q17. Finally, he asked me whether I had any questions
- Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
- Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
- Q20. We also talked a bit about my phone browser project
Interview Preparation Tips
Duration: 15 minutes
Total Questions: 1
Round: Test
Duration: 30 minutes
Total Questions: 2
Round: Test
Duration: 30 minutes
Total Questions: 3
Round: Test
Total Questions: 4
Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.
Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)
1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.
Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2. I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.
General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra
Skills evaluated in this interview
Interview Questionnaire
12 Questions
- Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
- Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
- Ans.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
- Q3. He then asked me to give test cases for testing this program
- Q4. Given two unsorted arrays of numbers and asked me to find the intersection
- Q5. GetMax() function for a stack in O(1)
- Ans.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
- Q6. GetMax() function for a queue in O(1)
- Ans.
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
- Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
- Q8. Given an array, find the Next Greatest Element to the right for each element
- Ans.
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
- Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
- Ans.
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
- Q10. Given an array of integers, find the maximum product which can be formed by three numbers
- Ans.
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
- Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
- Ans.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
- Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
OpenText Technologies Interview FAQs
Some of the top questions asked at the OpenText Technologies Senior Quality Assurance Engineer interview -
Tell us how to improve this page.
OpenText Technologies Interviews By Designations
- OpenText Technologies Senior Software Engineer Interview Questions
- OpenText Technologies Associate Software Engineer Interview Questions
- OpenText Technologies Software Engineer Interview Questions
- OpenText Technologies Intern Interview Questions
- OpenText Technologies QA Engineer Interview Questions
- OpenText Technologies Software Developer Intern Interview Questions
- OpenText Technologies Engineering Intern Interview Questions
- OpenText Technologies Software Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Quality Assurance Engineer Interview Questions
- Quality Assurance Interview Questions
- Quality Assurance Officer Interview Questions
- Associate Quality Assurance Interview Questions
- Executive Quality Assurance Interview Questions
- Manager Quality Assurance Interview Questions
- Assistant Manager Quality Assurance Interview Questions
- Junior Engineer - Quality Assurance Interview Questions
- Show more
OpenText Technologies Senior Quality Assurance Engineer Interview Process
based on 3 interviews
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
OpenText Technologies Senior Quality Assurance Engineer Reviews and Ratings
based on 9 reviews
Rating in categories
|
Software Engineer
1k
salaries
|  ₹6.5 L/yr - ₹26 L/yr |
|
Senior Software Engineer
922
salaries
| ₹12 L/yr - ₹40 L/yr |
|
Lead Software Engineer
386
salaries
| ₹16 L/yr - ₹50 L/yr |
|
Associate Software Engineer
373
salaries
| ₹6.6 L/yr - ₹17 L/yr |
|
Software Developer
238
salaries
| ₹5.7 L/yr - ₹23 L/yr |
Amdocs
Automatic Data Processing (ADP)
24/7 Customer
- Home >
- Interviews >
- OpenText Technologies Interview Questions >
- OpenText Technologies Senior Quality Assurance Engineer Interview Questions
