Software Engineer In Test I Interview Questions | Glassdoor

Software Engineer In Test I Interview Questions

22

Software engineer in test i interview questions shared by candidates

Top Interview Questions

Sort: Relevance Popular Date

You are given a n*n matrix of bits (1s and 0s) where 1 represents land and 0 represents water. Adjacent 1s can be considered as joined together to form sort of island in water. Count the number of islands. Discuss complexity.

2 Answers

int nCnt = 0; int land = 0; boolean bIsOne = false; int a[rows][cloumns]; int i,j; for(i = 0;i 1) { land ++; } nCnt = 0; bIsOne = false; } } } }

My runnable code is here. With the use of DFS, it is very straightforward! public class Island{ int[][] map; boolean[][] visited; int maxRow, maxCol; public Island(int [][] map){ this.map = map; maxRow = map.length - 1; maxCol = map[0].length - 1; visited = new boolean[maxRow + 1][maxCol + 1]; } public int islandCount(){ int count = 0; for(int i = 0; i maxRow || j > maxCol) return; if(!visited[i][j] && map[i][j] == 1) { visited[i][j] = true; runDFS(i - 1, j); runDFS(i , j + 1); runDFS(i + 1, j); runDFS(i , j + 1); } } public class questions{ public static void main(String [] args){ int [][] map = new int [][]{ {1, 1, 1, 1, 0}, {0, 1, 0, 1, 0}, {0, 1, 1, 0, 1} }; Island island = new Island(map); System.out.println(island.islandCount()); } }

What is the level of your documentation skills and SQL knowledge?

1 Answer

Rotate a string in clockwise direction ?

1 Answer

Write a method that returns how many time a letter appears in a string. Followed by how would you test it.

Given a string and a letter, How many times does the letter appear. Followed by how would you test it.

Consider a rectangular mesh (intersecting horizontal and vertical lines ). These lines represent intersecting roads. You are standing at top left intersection and you need to reach to a resort located at bottom right intersection. On your way, you can see interesting sights which are given points (weightage). You are lazy to walk (i.e. you wont walk left / up. You will only walk to right or down). While reaching resort , you want to cover maximum points (see things that have more weightage). Write a program to calculate maximum number of points that you can cover. He later asked me to improve solution by avoiding paths already visited.

1 Answer

Write an algorithm that takes function names from a program and will figure out if it is made up of valid words (1 or more).

110 of 22 Interview Questions