{"id":21359298,"url":"https://github.com/alesr/goexercises","last_synced_at":"2026-02-23T16:04:11.474Z","repository":{"id":85507596,"uuid":"84724936","full_name":"alesr/goexercises","owner":"alesr","description":"A serie of programming exercises (Project Euler, Codility, ...) with solutions written in GO.","archived":false,"fork":false,"pushed_at":"2017-03-12T13:05:18.000Z","size":15,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-08-02T15:50:11.483Z","etag":null,"topics":["codility","codility-solutions","euler","euler-solutions","go","golang","practice-golang"],"latest_commit_sha":null,"homepage":null,"language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/alesr.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-03-12T12:48:08.000Z","updated_at":"2023-03-20T06:00:34.000Z","dependencies_parsed_at":"2023-03-04T09:15:51.079Z","dependency_job_id":null,"html_url":"https://github.com/alesr/goexercises","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/alesr/goexercises","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alesr%2Fgoexercises","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alesr%2Fgoexercises/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alesr%2Fgoexercises/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alesr%2Fgoexercises/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/alesr","download_url":"https://codeload.github.com/alesr/goexercises/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alesr%2Fgoexercises/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29747981,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-23T07:44:07.782Z","status":"ssl_error","status_checked_at":"2026-02-23T07:44:07.432Z","response_time":90,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["codility","codility-solutions","euler","euler-solutions","go","golang","practice-golang"],"created_at":"2024-11-22T05:27:37.358Z","updated_at":"2026-02-23T16:04:11.462Z","avatar_url":"https://github.com/alesr.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# goexercises [![Build Status](https://travis-ci.org/alesr/goexercises.svg?branch=master)](https://travis-ci.org/alesr/goexercises)\n\n### PACKAGE DOCUMENTATION\n\nA serie of programming exercises (Project Euler, Codility, ...) with solutions written in GO.\n```\npackage goexercises\n    import \"github.com/alesr/goexercises\"\n```\n\n### FUNCTIONS\n\n```\nfunc BinaryGap(n int) int\n    BinaryGap -\n    https://codility.com/programmers/lessons/1-iterations/binary_gap/ Find\n    longest sequence of zeros in binary representation of an integer.\n\nfunc CyclicRotation(arr []int, rotation int) []int\n    CyclicRotation -\n    https://codility.com/programmers/lessons/2-arrays/cyclic_rotation/\n    Rotate an array to the right by a given number of steps.\n\nfunc EvenFibonacci(limit int) int\n    EvenFibonacci - https://projecteuler.net/problem=2 Each new term in the\n    Fibonacci sequence is generated by adding the previous two terms. By\n    starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13,\n    21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence\n    whose values do not exceed four million, find the sum of the even-valued\n    terms.\n\nfunc FizzBuzzWoof(n, d1, d2, d3 int) string\n    FizzBuzzWoof receives n, d1, d2, d3 as positive integer as arguments and\n    returns:\n\n\tFizz -\u003e if n is divisible by d1\n\tBuzz -\u003e if n is divisible by d2\n\tWoof -\u003e if n is divisible by d3\n\tFizzBuzz -\u003e if n is divisible by d1 and d2\n\tFizzWoof -\u003e if n is divisible by d1 and d3\n\tBuzzWoof -\u003e if n is divisible by d2 and d3\n\tFizzBuzzWoof -\u003e if n is divisible by d1 and d2 and d3\n\tstring(n) -\u003e if n is not evenly divisible by any given divisor\n\nfunc FrogJmp(x, y, d int) int\n    FrogJmp -\n    https://codility.com/programmers/lessons/3-time_complexity/frog_jmp/\n    Count minimal number of jumps from position X to Y.\n\nfunc LargestPalindromeProd(n int) int\n    LargestPalindromeProd - https://projecteuler.net/problem=4 A palindromic\n    number reads the same both ways. The largest palindrome made from the\n    product of two 2-digit numbers is 9009 = 91 × 99. Find the largest\n    palindrome made from the product of two 3-digit numbers.\n\nfunc LargestPrimeFactor(n int) int\n    LargestPrimeFactor - https://projecteuler.net/problem=3 The prime\n    factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor\n    of the number 600851475143?\n\nfunc MultiplesOf(n int) int\n    MultiplesOf - Multiples of 3 and 5 https://projecteuler.net/problem=1 If\n    we list all the natural numbers below 10 that are multiples of 3 or 5,\n    we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of\n    all the multiples of 3 or 5 below 1000.\n\nfunc OddOccurrences(arr []int) int\n    OddOccurrences -\n    https://codility.com/programmers/lessons/2-arrays/odd_occurrences_in_array/start/\n    Find value that occurs in odd number of elements.\n\nfunc PermCheck(slice []int) int\n    PermCheck -\n    https://codility.com/programmers/lessons/4-counting_elements/perm_check/\n    Check whether array A is a permutation.\n\nfunc PermMissingElem(arr []int) int\n    PermMissingElem -\n    https://codility.com/programmers/lessons/3-time_complexity/perm_missing_elem/\n    Find the missing element in a given permutation.\n\nfunc Prime10001(n int) int\n    Prime10001 - https://projecteuler.net/problem=7 By listing the first six\n    prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is\n    13. What is the 10 001st prime number?\n\nfunc SmallestMultiple(n int) int\n    SmallestMultiple - https://projecteuler.net/problem=5 2520 is the\n    smallest number that can be divided by each of the numbers from 1 to 10\n    without any remainder. What is the smallest positive number that is\n    evenly divisible by all of the numbers from 1 to 20?\n\nfunc SumSqrDiff(n int) int\n    SumSqrDiff - https://projecteuler.net/problem=6 The sum of the squares\n    of the first ten natural numbers is, 12 + 22 + ... + 102 = 385 The\n    square of the sum of the first ten natural numbers is, (1 + 2 + ... +\n    10)2 = 552 = 3025 Hence the difference between the sum of the squares of\n    the first ten natural numbers and the square of the sum is 3025 − 385 =\n    2640. Find the difference between the sum of the squares of the first\n    one hundred natural numbers and the square of the sum.\n\nfunc TapeEquilibrium(slice []int) int\n    TapeEquilibrium -\n    https://codility.com/programmers/lessons/3-time_complexity/tape_equilibrium/\n    Minimize the value `|(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|`\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falesr%2Fgoexercises","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Falesr%2Fgoexercises","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falesr%2Fgoexercises/lists"}