Interview Questions

Anonymous Hare - "Sharing the approach for functional requirements we tool to solve this question. Functional Requirements This is only for the Registered users What is a "For You" page ? Home page where you get suggestions based on people you follow. Interactions like/share/comments (done by user) Interests (shared by the user during registration or onboarding) sports choices/ region choices/ Video sharing platform. So how many videos should we s"See full answer

Woosung J. - "For a dataset with one million data points, a Deep Neural Network (DNN) is almost always the superior choice over a K-Nearest Neighbors (KNN) algorithm. The primary reasons for this preference involve computational efficiency, scalability, and the ability to handle high-dimensional data. 1. Computational Complexity (Inference Time) KNN: It is a "lazy learner." It doesn't actually "learn" a model; instead, it stores the entire dataset. To make a single prediction, it must calcul"See full answer

Alan T. - "The difference between convex and nonconvex functions lies in their mathematical properties and the implications for optimization problems. Convex Functions:A convex function has a shape where any line segment connecting two points on its graph lies entirely above or on the graph. This property ensures that any local minimum is also a global minimum, making optimization straightforward and reliable. Convex functions are critical in machine learning and optimization tasks because of th"See full answer

William M. - "Relu = 0 if > some threshold else x sigmoid normalizes to 0-1 asymptotically"See full answer

Bhavya V. - "Overfitting is the condition where your model is giving an unexpectedly higher accuracy because of its training in a small database and not getting exposed to anu different type of database while testing"See full answer

Dinar M. - "Even more faster and vectorized version, using np.linalg.norm - to avoid loop and np.argpartition to select lowest k. We dont need to sort whole array - we need to be sure that first k elements are lower than the rest. import numpy as np def knn(Xtrain, ytrain, X_new, k): distances = np.linalg.norm(Xtrain - Xnew, axis=1) k_indices = np.argpartition(distances, k)[:k] # O(N) selection instead of O(N log N) sort return int(np.sum(ytrain[kindices]) > k / 2.0) `"See full answer

Lash - "A perceptron is the most basic building block of a neural network and represents a single-layer binary classifier."See full answer

Michael F. - "As an interviewer, I have asked this question to candidates in the past. Here are the major topics I am looking for in an interview The candidate should understand that there are ways of measuring the loss of a particular clustering. For example, we can take the average distance of each point to it's cluster center. The candidate should understand that this loss will always decrease as the number of clusters increases. For that reason, we can't just pick the value of K that minimizes the l"See full answer