Interview Questions

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

Alessandro R. - "import java.util.*; public class NetworkTopology { public int topologytype(int N, int M, int[] input3, int[] input4) { if (M != N - 1 && M != N) return -1; // Fast check for invalid cases int[] degree = new int[N + 1]; // Degree of each node (1-based indexing) // Build the degree array for (int i = 0; i < M; i++) { degree[input3[i]]++; degree[input4[i]]++; } // Check for Bus Topology boolean isBus = (M"See full answer

Exponent - "This is a classic Favorite Product question with a constrained product type. For this, we want to make sure it's an enterprise product. Let's go over the Favorite Product formula before diving in: Choose a product and briefly explain what it is Who are the users? What are their pain points? How did competitors solve it in the past? How does this product address these pain points differently and better? How would you improve it/make it better? **Su"See full answer

Monika C. - "Iphone 12, It's sleek design , screen resolution, camera quality, sound quality, navigation around the apps very smooth and easy. Love the design !!"See full answer