In here shall be a set of tools that make it easier to complete Project Euler challanges using go language. Descirption :
- Counting digits
- Checking if number is n-pandigital
- Couting prime factors of a number
- Concatenating numbers
- Generating primes lookup via Erastothenes sieve
- Reversing digits order
- Array to Number and Number to Array
- Generating permutations of given numbers set
- Generating power set of given numbers set
- Highest common fraction
- Checking if string is a palindrome
- Reversing string
- Un/Directed Graph implementation
- Dijkstra
- Set implementation
- Priority Queue implementation