Test engineer Interview Questions | Glassdoor

Test engineer Interview Questions

3,573

test engineer interview questions shared by candidates

Top Interview Questions

Sort: RelevancePopular Date

Describe and code an algorithm that returns the first duplicate character in a string?

12 Answers

Simple Python example. Not sure it's most efficient. def findDup(str): match=[] i=1 while (i

first clarify if it is ASCII or UNICODE string For ASCII, create BOOL checkArray [128] = {false}; walk the string and update the index of checkArray based of the character. for (int index=0;index< strlen(str); index++) { if (checkArray[str[index]] == true) { printf (str[index]); return; } else { checkArray[str[index]] = true; } }

public class FirstDupCharacter { public static void main(String[] args) { System.out.println(findDupCharacter("abcdefghiaklmno")); } private static Character findDupCharacter(final String input) { final Set set = new HashSet(); Character dup = null; for (int i = 0; i < input.length(); i++) { if (set.contains(input.charAt(i))) { dup = input.charAt(i); break; } else { set.add(input.charAt(i)); } } return dup; } }

One or more comments have been removed.
Please see our Community Guidelines or Terms of Service for more information.

In a given sorted array of integers remove all the duplicates.

8 Answers

Write a method to decide if the given binary tree is a binary search tree or not.

4 Answers

Implement a binary tree and explain it's function

4 Answers

how can a particular application be tested apart from testing its functionality

4 Answers

Given a string (understood to be a sentence), reverse the order of the words. "Hello world" becomes "world Hello"

2 Answers

Write code in your favorite programming language that will accept two strings and return true if they are anagrams.

2 Answers

Given a set of numbers -50 to 50, find all pairs that add up to a certain sum that is passed in. What's the O notation for what you just wrote? Can you make it faster? Can you find an O(n) solution? Implement the O(n) solution

17 Answers

Most of them were expected. Almost all are problem solving questions. 1. Given a BST with following property find the LCA of two given nodes. Property : All children has information about their parents but the parents do not have information about their children nodes. Constraint - no additional space can be used

15 Answers

Phone interview 1 : a) Simulate a Queue with stacks ? b)Find repeated occurrence of character in a string ? Phone interview 2 : a) Given a 2D matrix of numbers find the position of number . Constraints of matrix number always in increasing order left to right and top to bottom . b)When should version control be used . And a tricky discreet math problem ?

13 Answers
110 of 3,573 Interview Questions