A from-scratch classic that tests recursion plus the split criterion math. The signal is computing impurity correctly, choosing the best threshold by information gain, and knowing the stopping rules. Here is a clean recursive implementation.
← Coding & DSA / 115
Build a decision tree classifier from scratch: pick splits by Gini or entropy, then predict.
A from-scratch classic that tests recursion plus the split criterion math. The signal is computing impurity correctly, choosing the best threshold by information gain, and knowing the stopping rules. Here is a clean recursive implementation.
Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.
Unlock the other 754 answers · ₹2,000 / $25includes both full courses · progress stays saved · 6 months · one payment · no auto-renew
LEARN THE BACKGROUND
No lesson covers this question directly yet. These teach the surrounding topic from the beginning.
UP NEXT ON YOUR JOURNEY
Next in this trackGaussian Naive Bayes from scratch: per-class stats and log space.Next in this trackImplement PCA from scratch via SVD: center the data, project onto top components, report variance.Next in this trackImplement a Gaussian Mixture Model with EM from scratch: E-step responsibilities, M-step updates.
DISCUSSION · 0
No comments yet — be the first to share your approach.
