Machine Learning Engineer Interview Questions

Shibin P. - "A typical computer vision pipeline consists of several key stages that process and analyze visual data to extract meaningful information. Here’s a general outline of the steps involved: Image Acquisition:Capturing images or videos using cameras or other imaging devices. Preprocessing steps such as resizing, cropping, and converting color spaces. Image Preprocessing:Noise reduction (e.g., using filters like Gaussian blur). Image normalization to standardize pixel values. Contrast e"See full answer

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

Vishwanath K. - "DevOps Engineer Interview Questions for 3+ yrs experience candidate"See full answer

Areeba M. - "create a queue push all cells with 0 into queue Mark all 1s as unvisited (-1 or large value) Run BFS for each cell, explore 4 directions If neighbor is unvisited:distance = current + 1 push into queue "See full answer

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

Ayush B. - "focus was on tradeoffs of diff object detection algorithms, data collection and labelling, foundational models, followup: not working well in production, retraining/active learning"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