It helps to know more about algorithms
Paint fence algorithm : Given a fence with n posts and k colors, find out the number of ways of painting the fence such that at most 2 adjacent posts have the same color.
Sieve Erasthones algorithm : The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million or so
I have contributed two algorithms and one project
Tracks Applied (1)
Replit
Technologies used
Discussion