Difficulty: Medium
Category: Brainteasers
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: python, overflow, math, algorithms
You are auditing a helper function designed to calculate the number of trailing zeros in n!. The developer attempts to calculate the full factorial first and then count the zeros. What is the primary issue with the implementation below when n becomes very large (e.g., $n = 10,000$)?
Practice this medium trader interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.