Quick Overview

This question evaluates a candidate's understanding and practical implementation skills for instance-based supervised learning, specifically the k-nearest neighbors algorithm, covering distance metrics, neighbor selection, majority voting and tie-breaking, feature scaling effects, time complexity, and model selection considerations like k and weighting. It is commonly asked to assess both conceptual grasp of non-parametric classification and practical coding ability to implement and analyze algorithms, and it falls under coding & algorithms and machine learning domains with a mix of conceptual understanding and practical application.

Implement KNN from Scratch

Company: J.P. Morgan

Role: Data Scientist

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: This question evaluates a candidate's understanding and practical implementation skills for instance-based supervised learning, specifically the k-nearest neighbors algorithm, covering distance metrics, neighbor selection, majority voting and tie-breaking, feature scaling effects, time complexity, and model selection considerations like k and weighting. It is commonly asked to assess both conceptual grasp of non-parametric classification and practical coding ability to implement and analyze algorithms, and it falls under coding & algorithms and machine learning domains with a mix of conceptual understanding and practical application.

Loading…