Machine Learning Engineer Interview Questions

Reno S. - "func isMatch(text: String, pattern: String) -> Bool { // Convert strings to arrays for easier indexing let s = Array(text.characters) let p = Array(pattern.characters) guard !s.isEmpty && !p.isEmpty else { return true } // Create DP table: dpi represents if s[0...i-1] matches p[0...j-1] var dp = Array(repeating: Array(repeating: false, count: p.count + 1), count: s.count + 1) // Empty pattern matches empty string dp[0]["See full answer

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

Vishnu V. - "// Helper function to calculate the Euclidean distance between two points function distance(p1, p2) { return Math.sqrt(Math.pow(p1[0] - p2[0], 2) + Math.pow(p1[1] - p2[1], 2)); } // A helper function to find the closest pair in a given set of points within the strip function closestPairInStrip(strip, d) { let minDist = d; // Start with the current minimum distance strip.sort((a, b) => a[1] - b[1]); // Sort the strip by y-coordinate for (let i = 0; i < strip.length; i++) { "See full answer

Isnadea soraya R. - "untuk mengurutkan daftar angka secara efisien saya akan menggunakan aplikasi pengolah angka yaitu excel dengan rumus rumus untuk mempermudah dan mempercepat pengurutan daftar angka"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

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

Satyam C. - "TF-IDF CONCEPT EXPLANATION AND INTUITION BUILDING: TF-IDF is a measure that reflects the importance of a word in the document relative to a collection of documents. Its full form is Term Frequency - Inverse Document Frequency. The term TF indicates how often a term occurs in a particular document. It is the ratio of count of a particular term in a document to the number of terms in that particular document. So, the intuition is that if a term occurs frequently in a single documen"See full answer

Murali M. - "The rule doesn't work the other way around. If the array is smaller than n, it can still have duplicates. Eg: n=10 , arr = [3,3]"See full answer