Interview Questions

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

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

Bhavya V. - "BERT - bidirectional encoder representations from transformer. For example:- it takes an entire sentence as input at once and understands the meaning of the words in that sentence and calculate the relations of words with each other irrespective of their positions from the original word to understand the meaning of the word using neighboring words. BERT model is a pre trained transformer model which can be fine-tuned for our purposes. It is used for tasks such sentimental analysis, question answ"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

Ina K. - "HashMap supports insert, search, delete and retrieve in O(1). It stores data as key value pairs."See full answer

Tiago R. - "function isValid(s) { const stack = []; for (let i=0; i < s.length; i++) { const char = s.charAt(i); if (['(', '{', '['].includes(char)) { stack.push(char); } else { const top = stack.pop(); if ((char === ')' && top !== '(') || (char === '}' && top !== '{') || (char === ']' && top !== '[')) { return false; } } } return stack.length === 0"See full answer

Tiago R. - "class TrieNode { constructor() { this.children = {}; this.isEndOfWord = false; } } class Trie { constructor() { this.root = new TrieNode(); } insert(word) { let node = this.root; for (const char of word) { if (!node.children[char]) { node.children[char] = new TrieNode(); } node = node.children[char]; } node.isEndOfWord = true; } search(word) { l"See full answer