Interview Questions

Saurabh J. - "The algorithm calculates certain metrics like entropy & Gini Impurity. The goal of the decision tree algorithm is to find the most optimal value for these metrics, lowest values for Gini Impurity & Entropy. Once it converges on the minima, it creates a split & grows the branches."See full answer

Indranil G. - "German autobahns are the highways and not city rode. We need to break down the issue into multiple stages. Let's say for the first stage we need to identify the road density. oad density is a very rough guess. Break down the problem further into city road density and non-city road density, and estimating the rough land mass of both. We came to 1km road / square km in non-cities road density , 3.4 million square miles of non-city, that bring us total (3.4 million *1)km - 3400,000 km of road we"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

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

Andrew B. - "Group the data by product, and then sort by time."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