Software Quality Engineer Interview Questions | Glassdoor

Software Quality Engineer Interview Questions

234

Software quality engineer interview questions shared by candidates

Top Interview Questions

Sort: RelevancePopular Date

Software Quality Assurance Engineer at CA Technologies was asked...

Nov 6, 2014
 If you had a great idea to implement something new for a CA software product but management wouldn't take your word on it, how would you convince management to go along with your idea?1 AnswerI would try to create a form of a prototype of said idea and present it along with taking ownership and compassion for the new feature.

Software Quality Engineer at Salesforce was asked...

Dec 19, 2011
 Give an array of Integer which contain duplicate number from 1-100, how to count how many distinct number you have?7 AnswersHashSet hs= new HashSet(); for (Integer x: inputArray){ hs.add(x); } s.o.p(hs.size());//If input: 1,2,3,1,4,6,3,7,8,9,0. Then your code will return 9, but it should return 7. //Improved code Set distinctSet = new HashSet(); for(int i = 0; iHi Hiten, the answer should return 9 instead of 7, cuz you want to find the distinct number, this hashset should have 1,2,3,4,6,7,8,9,0, which have 9 elements insideShow More Responsesnumber of distinct integers in array = number of integers in array - number of duplicate integers number of integers in array = length of array So, this becomes a problem of finding the number of duplicates. This can be accomplished in O(N) time using the following algo: public static void countDistinct(int[] arr){ //numbers are b/w 1-100 boolean[] hit = new boolean; int dup = 0; for(int i=0;ipublic static int distinct(int a[]){ boolean map[] = new boolean; int dup=0; for(int i=0;iint distinct(int []x) { bool []count= new bool; int n = x.Length; for (int i = 0; i < x.Length; ++I) { if(count[x[i]]) n--; count[x[i]] = true; } return n; }Use a set. Iterate through the array and insert each element in a set. then get set.size()

Software Quality Engineer at MicroStrategy was asked...

May 14, 2013
 The brain teaser: what is the last digit of 2007 power 20074 AnswersI first was scared by this question, but after a few seconds, I figure out how to answer it with recursion.Last digit of 7^1 is 7. last digit of 7^2 is 9. Last digit of 7^3 is 3. Last digit of 7^4 is 1. After this, the last digits repeat in the same pattern. 2007 divided by 4 is 501 with reminder is 3. Therefore the last digit is not 7, not 9, but 3. (the third case).Answer: Concept: for n^n multiple resultant number in units place n-1 times with n. Answer: Just multiply the units place of the result wit 7 , six times.. i.e 1st iteration- 7 x 7 = 49 take number in units place i.e 9 mul by 7--> 2nd iteration- 9 x 7 = 63 3rd iteration- 3 x 7=21 4th iteration- 1 x 7=7 5th iteration- 7x7=49 6th iteration- 9 x 7=63 Note we have to take only 6 iterations because we have already considered 7 twice in the first iteration. i.e 7 multiplied by SIX 7s So the digit would be 3.Show More Responsessimple solution is : 7^1 = 7 7^2 = 9 7^3 = 3 7^4 = 1 7^5 = 7 7^6 = 9 7^7 = 3 7^8 = 1 so pattern follows in 4 part so 2007 mod 4 = 3 so Third pattern answer is 3

Software Quality Engineer at Newfield Wireless was asked...

Apr 5, 2013
 Interview questions: recursion, probability4 AnswersCan you please tell more about onsite interview?It was from around 10am to around 3-4pm, many 1:1 interviews with other team members, team leader, HR, and other people in the company. Interview with team members and the team leader was mostly technical to see how smart you are, how fast/well you can code, and other questions related to the position. Interview with HR, and other people in the company was just general, introduce you to the company's business, what they do. And the purpose was, I think, to see how you like and fit in the company's culture.Thanks a lot. Really appreciate it. Can you be please more specific about onsite questions they were asked. That would immensly help me !Show More ResponsesYes, it would be really helpful if you could give the topics or questions of the technical rounds of the interview

Software Quality Engineer at Salesforce was asked...

Dec 19, 2011
 How to reverse a String? How to deal with it if the input string is null?4 Answersstring a=""; for(int i=a.length()-1; i>=0; i--){ str+=a.charAt(a); } return str; }The above approach becomes O(N^2) due to use of += inside a for loop. Every time we use +=, a new string is created from the copied over contents of the last string to which another string is appended. On an average there are N/2 copy operations. This can be bettered using StringBuilder like this: StringBuffer strBuffer = new StringBuffer(); for(int i=a.length()-1; i>=0; i--){ strBuffer.append(a.charAt(a)); } return strBuffer.toString(); } However, this can be improvised even more using the just N/2 iterations (instead of N above) : public String reverse( String string ) { byte[] array = string.getBytes(); byte swap; for( int i = 0, j = array.length - 1; i < array.length / 2; i++, j-- ) { swap = array[ j ]; array[ j ] = array[ i ]; array[ i ] = swap; } return new String( array ); }If you want to save on the extra "swap" memory, you can use bitwise operator XOR like this: public String reverse( String string ) { byte[] array = string.getBytes(); for( int i = 0, j = array.length - 1; i < array.length / 2; i++, j-- ) { array[ i ] ^= array[ j ]; array[ j ] ^= array[ i ]; array[ i ] ^= array[ j ]; } return new String( array ); }Show More Responsesthe use of Xor is awesome! Good one.

Software Quality Engineer at MicroStrategy was asked...

Mar 3, 2013
 There are 4 people going through a bridge. One takes 5-min, one takes 1-min, one takes 2-min, and one takes 10-min. And only two people can go through once. Question: what is the shortest time that 4 people cross the bridge?3 AnswersIts a common puzzle but your question is incomplete. the two people can only cross the bridge by using a torch. So one guy will always hold the torch. Solution: first 10 & 1 will go and then 1 will return back. - total time = 10+1 = 11 mins then 1 & 5 will go and 1 will return back - total time = 5+1 = 6 mins then 1&2 will go = total time = 2mins total time = 19 mins !!Correct answer is 17. -> 2+1 :2 10+5 :10 1+2 :2if no pass, then 12 mins, if someone can pass through another, then 10 mins.

Software Quality Engineer at MicroStrategy was asked...

Apr 12, 2013
 A very hard brain teaser that requires creativity. You don't necessarily have to get the right answer, but you have to come up with some intelligent ways of tackling the problem. Don't be afraid to talk about your thought process, even if it's not right. 2 AnswersCan you provide some details in the brain teasers? Like what is it or how hard is the brain beasers level? And if it is possible, can you more specifically say something about the procedure when you interview? That would be great. Thanks a lot.Hey can you please elaborate as to the kind of questions you faced? Would greatly appreciate it. Thanks!

Oct 3, 2015