Aadithya-V

Solutions to problems 1 to 100 of projecteuler.net. Solutions to problems >100 are not permitted to be published publically.

Click this gist to view the folder of gists or go to https://gist.github.com/Aadithya-V/7d2bf0fa841d73b7b05bee0fb2398e5c

Mostly implemented in golang. Sharing the beautiful code :)

I recommend to not look at the solutions and try to solve on your own. It's fun!

These gists will be removed by the end of 2023.

Aadithya-V

// For modulo not remainder: 
// n mod m = n-⌊nm⌋.m
func FloorMod(n, m int) int {
    res := n % m // remainder operator, strictly speaking: example- 
    //If -8 % 7 == 6, you're fine, but if it is -1, you'll need to adjust it by 
    //adding m to any negative results as below.
    if res < 0 {
        res += m
    }
    return res

Aadithya-V

package main

import (
	"fmt"
	"sync"

	"golang.org/x/tour/tree"
)

// Walk walks the tree t sending all values

Aadithya-V

package main

import (
	"fmt"
	"sync"
)

type Fetcher interface {
	// Fetch returns the body of URL and
	// a slice of URLs found on that page.

Aadithya-V

package main

import (
	"io"
	"os"
	"strings"
)

type rot13Reader struct {
	r io.Reader

Aadithya-V

package main

import (
	"golang.org/x/tour/wc"
	"strings"
)

func WordCount(s string) map[string]int {
	tokens := strings.Fields(s)
	m := make(map[string]int)