Project Euler 20

https://

In this video, I will be coding the solution for the problem #

Adding up all the digits in 100! (factorial, not yelling the number). Videos going forward should be in 1440p 60fps if all goes right.

Want my help with your code? Check out the options here: https://bio.site/problemsolvingwizard

In this video we solve the

I use the Big Integer class from the last two videos to solve

n! means n x (n-1) x ... x 3 x 2 x 1. For example, 10! = 10 x 9 x ... x 3 x 2 x 1 = 3628800, and the sum of the digits in the number 10!

I mean BigInt just melts this one. It's perhaps against the spirit of

Factorial Digit Sum. Please Subscribe! Leave comments and questions in the comment section below.

In this one we are basically just combining a few basic concepts we have already covered previously so this one is really quick.

https://

We're solving some algorithmics problems from

Short and sweet; like that one girl in college you should've asked out, or shortbread cookies

Solving

In this video we use graph theory and knowledge of a famous NP-complete problem to tackle the first problem from

Links:

https://amzn.to/4aLHbLD You're literally one click away from a better setup — grab it now! As an Amazon Associate I earn ...

Here is my attempt at

Please watch: "CSES problem #4: Increasing Array" https://www.youtube.com/watch?v=FiHSPt_cBV0 -~-~~-~~~-~~-~-

In this video I tackle a problem about cyclic sets of figurate numbers. Have you ever heard of a heptagonal number?