sonik8494 / fractal_hackerrank_hiring_challenge_3

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Fractal Hackerrank Hiring Challenge 3

Problem statement

Sam loves chocolates and starts buying them on the 1st day of the year. Each day of the year, x, is numbered from 1 to Y. On days when x is odd, Sam will buy x chocolates; on days when x is even, Sam will not purchase any chocolates.

ezoic increase your site revenue



Language:Python 87.0%Language:Jupyter Notebook 13.0%