OpenText Interview Questions

OpenText Java Selenium Automation Interview Questions: In The Various companies testing interview questions series of post we are added the latest interview questions and answers for SDET, Software Tester, and Manual & Automation Testng Question and Answers For Freshers and experience Testers.

Opentext Exstream Hacker Rank Interview Questions

Updated on: 07-07-2022

Write a java program for a given input array A consisting of N integers, and returns the biggest value X, which occurs in A exactly X times. If there is no such value, the function should return 0.

Input/Expected Output:

int[] intArray = { 3, 8, 2, 3, 3, 2 }; // Output : 3
int[] intArray1 = { 7, 1, 2, 8, 2 }; // Output : 2
int[] intArray2 = { 3, 1, 4, 1, 5 }; // Output : 0
int[] intArray3 = { 5, 5, 5, 5, 5, 5 }; // Output : 0
int[] intArray4 = { 5, 5, 5, 5, 5 }; // Output : 5

package com.SoftwareTestingo.InterviewPrograms;

public class OpentextInterviewPrograms 
{
	public static void main(String[] args) 
	{
		// TODO Auto-generated method stub
		int[] ar = {3,8,2,3,3,2};
		int[] ar1 = {7,1,2,8,2};
		int[] ar2 = {3,1,4,1,5};
		int[] ar3 = {5,5,5,5,5,5};
		int[] ar4 = {5,5,5,5,5};
		System.out.println(validate(ar));
		System.out.println(validate(ar1));
		System.out.println(validate(ar2));
		System.out.println(validate(ar3));
		System.out.println(validate(ar4));
	}
	public static int validate(int ar[]) 
	{
		int bigNumb=0;
		int count=0;
		for(int i=0; i<ar.length; i++)
		{
			for(int j=0;j<ar.length;j++)
			{
				if(ar[i]==ar[j]) 
				{
					count++;
				}
			}
			if(count==ar[i]&&bigNumb<ar[i])
			{
				bigNumb=ar[i];
			}
			count=0;
		}
		return bigNumb;						
	}
}

Ques: Write a Java program for a given array A of N integers, return the smallest positive integer (greater than 0) that does not occur in A.

Examples:

1. Given A = [1, 3, 6, 4, 1, 2], the function should return 5.
2. Given A = [1, 2, 3], the function should return 4.
3. Given A = [−1, −3], the function should return 1.

Assumption:

1. N is an integer within the range [1..100,000].
2. Each element of array A is an integer within the range [−1,000,000..1,000,000].

package com.SoftwareTestingo.InterviewPrograms;
import java.util.Arrays;
public class SmallestPositiveIntegerNotInArray 
{
	public static int solution(int[] inputArray)
	{
		int smallestInt = 1;
		if (inputArray.length == 0)
			return smallestInt;
		Arrays.sort(inputArray);
		if (inputArray[0] > 1)
			return smallestInt;
		if (inputArray[inputArray.length - 1] <= 0)
			return smallestInt;
		for (int i = 0; i < inputArray.length; i++) 
		{
			if (inputArray[i] == smallestInt) 
			{
				smallestInt++;
			}
		}
		return smallestInt;
	}
	public static void main(String[] args) 
	{
		int[] inputArray = { 10, 2, 25, 43, 0, 67, 1, 7 }; // Output: 3
		int[] inputArray1 = { 1, 3, 6, 4, 1, 2 }; // Output: 5
		int[] inputArray2 = { 1, 2, 3 }; // Output: 4
		int[] inputArray3 = { -1, -3 }; // Output: 1
		System.out.println(solution(inputArray));
		System.out.println(solution(inputArray1));
		System.out.println(solution(inputArray2));
		System.out.println(solution(inputArray3));
	}
}

Ques: Write a Java program that, given integer N, returns the smallest non-negative whose individual digits sum to N.

Example:

• N = 16; the function should return 79. There are many numbers like 79, 97, 808, 5551, 22822, etc. whose digits sum to 16 but the lowest such number is 79.
• N = 19; the function should return 199. The sum of digits 1+9+9=19.
• If N = 7; the function should return 7;
• Assume N = 0 to 50.

package com.SoftwareTestingo.InterviewPrograms;
import java.util.Arrays;
public class Smallest 
{
	public static boolean sumNo(int n, int N)
	{
		int sum=0;
		while (n!=0)
		{
			sum=sum+n%10;
			n=n/10;
		}
		if(sum==N)
		{
			return true;
		}
		return false;
	}
	public static void main(String[] args) 
	{
		// TODO Auto-generated method stub
		int[] arr = { 97, 898, 5506, 79, 22822 };
		Arrays.sort(arr);
		for (int i= 0; i < arr.length; i++) 
		{ 
			if (sumNo(arr[i], 16)) 
			{
				System.out.println("smallest no" + arr[i]);
				break;
			}
		}
	}
}

Source: FB Groups

OpenText Automation Interview Questions

Updated on: 18.05.2019

• Write a java program to select a particular character from a string using regular expression
• Write a program to reverse a string
• Which part of the selenium overloading and overriding method concept implemented
  Ans: Overloaded Methods of Selenium are:-
  .frame(string), frame(int), frame(WebElement).
  .findElement(“<All type of locator e.g. id , XPath , cssClass>”).
  wait(), wait(timeout), wait(timeout,Nanos)
  and WebDriverWait methods
• How to handle exceptions in java
• What is finally and final
• What are a hash map and hash table
• What is the return type of windows handles
• What is the return type of getattribute() and gettext()
• How to handle multiple browser windows
• What is the glue in cucumber
• What is background, datatable in cucumber
• When to use AutoIT
• Which are the cases we cannot automate
• How much per cent automation covered in your project

OpenText Selenium Interview Questions

• Introduce yourself
• Write a program for Fibonacci series
• Write a program to write data into the c3 column by dividing c1/c2. C3=c1/c2
• How will add a column without knowing the table structure
• They want the candidates who know ETL testing