Software Engineer Interview Questions

Kamlesh S. - "min-num = arr[0] max-num = arr[0] for (i=1; i max-num) { max-num = arr[i]; } } System.out.println("Minimum = " + min-num); System.out.println("Maximum = " + max-num);"See full answer

Prashant Y. - "The height of a binary tree is the maximum number of edges from the root node to any leaf node. To calculate the height of a binary tree, we can use a recursive approach. The basic idea is to compare the heights of the left and right subtrees of the root node, and return the maximum of them plus one."See full answer

Emma X. - "String commonStr(String str1, String str2) { int len1 = str1.length(); int len2 = str2.length(); if (len1 == 0 || len2 == 0) return ""; // let dpx reprsent the longest common str of 0...x int dp = new int len1 + 1; int maxLen = 0; int endIndex = 0; for (int i = 1; i <= len1; i++) { for (int j = 1; j <= len2; j++) { if (str1.charAt(i-1) == str2.charAt(j-1)) { dpi = dpi-1 + 1; "See full answer

מיכל ש. - "משימת בית פרונט עם התחברות לשרת רמה היה ממש קל"See full answer