@ -1,9 +1,10 @@
package main
import (
student "student"
"./base"
"./correct"
"./student"
"github.com/01-edu/public/go/lib"
)
@ -3,8 +3,9 @@ package main
"fmt"
func main() {
@ -1,8 +1,9 @@
"reflect"
"strconv"
"sort"
"lib"
// Receives 5 ints and returns the number in the middle
// Function that return the number of active bits in the number passed as the argument
@ -5,7 +5,7 @@ import (
"os"
"github.com/01-edu/public/go/lib/is"
"lib/is"
@ -3,8 +3,8 @@ package main
@ -5,8 +5,9 @@ import (
"strings"
func advancedSortWordArr(a []string, f func(a, b string) int) {
"unicode"
func alphaCount(s string) (i int) {
@ -1,7 +1,7 @@
func any(f func(string) bool, a []string) bool {
func appendRange(min, max int) []int {
func atoi(s string) int {
func basicAtoi(s string) int {
func basicAtoi2(s string) int {
func basicJoin(elems []string) string {
@ -3,7 +3,7 @@ package main
@ -4,8 +4,9 @@ import (
func capitalize(s string) string {
func chunk(a []int, ch int) {
func collatzCountdown(start int) int {
func compact(slice *[]string) int {
func concatParams(args []string) string {
func countIf(f func(string) bool, a []string) int {
@ -4,7 +4,7 @@ import (
type node struct {
const size = 8
// Helper function used in the test for checking the function Enigma()
func fib(n int) int {
func fibonacci(i int) int {
func findNextPrime(nb int) int {
func findPrevPrime(nb int) int {
func firstRune(s string) rune {
func foldInt(f func(int, int) int, a []int, n int) {
func forEach(f func(int), a []int) {
func game23(a, b int) int {
func validRegExp(n int) string {
func halfContest(h1, m1, h2, m2 int) int {
func index(s string, substr string) int {
func isInteresting(n int) bool {
func isAlpha(s string) bool {
func isAnagram(s, t string) bool {
func isNegative(n int) {
@ -3,9 +3,10 @@ package main
"math/rand"
func isPrintable(s string) bool {