Interview Questions

Vipin G. - "// Function to delete a node from BST. public static Node deleteNode(Node root, int X) { // code here. if(root == null) return root; if(X root.data){ root.right = deleteNode(root.right, X); return root; } if(root.left == null){ return root.right; }else if(root.right == null){ "See full answer

Hinata T. - "bool isConsecutive(int arr[], int n) { // base case if (n max) { max = arr[i]; } } // for an array to contain consecutive integers, the difference between // the maximum and minimum element in it should be exactly \n-1\ if (max - min != n - 1) { return false; } // create an empty set (we can also use a visit"See full answer

Exponent - "This is a Technical question. It tests your ability to understand high level technical concepts. Even though your job won't have any coding involved, you'll still need to understand these concepts. Being able to cover all these topics with clarity communicates confidence in your interviewer. Unfortunately, there's no formula for technical questions, but some general tips are: Use analogies when you can Break your solution into clear, bite-size steps Don't be afraid to use examples to b"See full answer

Zvi D. - "printarr(subarr) for sub_arr in arr; function printarr(subarr) { print(elem) for elem in sub_arr }"See full answer

Padmanaban M. - "static int findLongestRepeatingSubSeq(String str) { int n = str.length(); int dp = new intn+1; for (int i=0; i<=n; i++) for (int j=0; j<=n; j++) dpi = 0; for (int i=1; i<=n; i++) { for (int j=1; j<=n; j++) { if (str.charAt(i-1)== str.charAt(j-1) && i != j) dpi =  1 + dpi-1; else dpi = Math.max(dpi, dpi-1); } } `return"See full answer

Anonymous Narwhal - "As the array is sorted, would it best to use binary search to find the one the triplet and just navigate from it."See full answer

Somdip S. - "The idea of prefix sum can be applied here to find a product prefix array and a product suffix array. Create a prefix product array by calculating the cumulative product of all elements which appear before that particular element in the array. Similarly, create a suffix array for all elements which appear later than particular element in the array. Now, replace each element with the product of prefix and suffix products of adjacent elements. This will give you the answer."See full answer