Machine Learning Engineer Interview Questions

Divya R. - "static boolean sudokuSolve(char board) { return sudokuSolve(board, 0, 0); } static boolean sudokuSolve(char board, int r, int c) { if(c>=board[0].length) { r=r+1; c=0; } if(r>=board.length) return true; if(boardr=='.') { for(int num=1; num<=9; num++) { boardr=(char)('0' + num); if(isValidPosition(board, r, c)) { if(sudokuSolve(board, r, c+1)) return true; } boardr='.'; } } else { return sudokuSolve(board, r, c+1); } return false; } static boolean isValidPosition(char b"See full answer

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

Anonymous Roadrunner - "from typing import List def traprainwater(height: List[int]) -> int: if not height: return 0 l, r = 0, len(height) - 1 leftMax, rightMax = height[l], height[r] res = 0 while l < r: if leftMax < rightMax: l += 1 leftMax = max(leftMax, height[l]) res += leftMax - height[l] else: r -= 1 rightMax = max(rightMax, height[r]) "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

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

Vince 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

Xuelong A. - "I've participated in several competitions in Kaggle concerning medical images. My most recent competition deals with images of skin lesions and classifying them as either melanoma or not. I focused on fine-tuning pretrained models and ensembling them. I also like to keep track of the latest trends of computer vision research, with a focus on making models memory-efficient through model compression and interpretability."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

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

Kunal kumar S. - "simply check its size if the size if the size is greater than n then yes it has duplicate"See full answer