Intermediate commit

tests/go/solutions/abort.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "sort"
 

tests/go/solutions/activebits.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // Function that return the number of active bits in the number passed as the argument
 func ActiveBits(n int) (total int) {

tests/go/solutions/addlinkednumbers.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 type NodeAddL struct {
 	Next *NodeAddL

tests/go/solutions/addlinkednumbers/test_addlinkednumbers.go

@@ -5,11 +5,11 @@ import (
 
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 type stuNode = NodeAddL
-type solNode = solutions.NodeAddL
+type solNode = correct.NodeAddL
 
 func stuPushFront(node *stuNode, num int) *stuNode {
 	tmp := &stuNode{Num: num}
@@ -112,7 +112,7 @@ func main() {
 
 	for _, arg := range args {
 		stuResult := AddLinkedNumbers(stuNumToList(arg[0]), stuNumToList(arg[1]))
-		solResult := solutions.AddLinkedNumbers(solNumToList(arg[0]), solNumToList(arg[1]))
+		solResult := correct.AddLinkedNumbers(solNumToList(arg[0]), solNumToList(arg[1]))
 
 		compareNodes(stuResult, solResult, arg[0], arg[1])
 	}

tests/go/solutions/advancedsortwordarr.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "sort"
 

tests/go/solutions/alphacount.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "unicode"
 

tests/go/solutions/any.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func Any(f func(string) bool, arr []string) bool {
 	for _, el := range arr {

tests/go/solutions/appendrange.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func AppendRange(min, max int) []int {
 	size := max - min

tests/go/solutions/atoi.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strconv"
 

tests/go/solutions/atoibase.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strings"
 

tests/go/solutions/atoibaseprog/test_atoibaseprog.go

@@ -5,7 +5,7 @@ import (
 
 	"./base"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 // this is the function that creates the TESTS
@@ -43,7 +43,7 @@ func main() {
 		node{s: "bbbbbab", base: "-ab"},
 	)
 	for _, arg := range table {
-		z01.Challenge("AtoiBaseProg", AtoiBase, solutions.AtoiBase, arg.s, arg.base)
+		z01.Challenge("AtoiBaseProg", AtoiBase, correct.AtoiBase, arg.s, arg.base)
 	}
 }
 

tests/go/solutions/atoiprog/test_atoiprog.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -32,6 +32,6 @@ func main() {
 		"123a45",
 	)
 	for _, arg := range table {
-		z01.Challenge("AtoiProg", Atoi, solutions.Atoi, arg)
+		z01.Challenge("AtoiProg", Atoi, correct.Atoi, arg)
 	}
 }

tests/go/solutions/basicatoi.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strconv"
 

tests/go/solutions/basicatoi2.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strconv"
 

tests/go/solutions/basicjoin.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func BasicJoin(a []string) (b string) {
 	for _, s := range a {

tests/go/solutions/btree.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 type TreeNode struct {
 	Left, Right, Parent *TreeNode

tests/go/solutions/capitalize.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import (
 	"strings"

tests/go/solutions/challenge.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import (
 	"reflect"

tests/go/solutions/changeorder.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func pushBack(node *NodeAddL, num int) *NodeAddL {
 	nw := &NodeAddL{Num: num}

tests/go/solutions/changeorder/test_changeorder.go

@@ -5,11 +5,11 @@ import (
 
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 type stuNode = NodeAddL
-type solNode = solutions.NodeAddL
+type solNode = correct.NodeAddL
 
 func stuPushFront(node *stuNode, num int) *stuNode {
 	tmp := &stuNode{Num: num}
@@ -99,7 +99,7 @@ func main() {
 
 	for _, arg := range table {
 		stuResult := Changeorder(stuNumToList(arg))
-		solResult := solutions.Changeorder(solNumToList(arg))
+		solResult := correct.Changeorder(solNumToList(arg))
 
 		compareNodes(stuResult, solResult, arg)
 	}

tests/go/solutions/chunk.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "fmt"
 

tests/go/solutions/chunk/test_chunk.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func randomSize() []int {
@@ -36,6 +36,6 @@ func main() {
 		ch:    0,
 	})
 	for _, args := range table {
-		z01.Challenge("Chunk", Chunk, solutions.Chunk, args.slice, args.ch)
+		z01.Challenge("Chunk", Chunk, correct.Chunk, args.slice, args.ch)
 	}
 }

tests/go/solutions/collatzcountdown.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func CollatzCountdown(start int) int {
 	if start <= 0 {

tests/go/solutions/compact.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func Compact(slice *[]string) int {
 	count := 0

tests/go/solutions/compare.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strings"
 

tests/go/solutions/concat.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func Concat(a, b string) string {
 	return a + b

tests/go/solutions/concatparams.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strings"
 

tests/go/solutions/convertbase.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func ConvertNbrBase(n int, base string) string {
 	var result string

tests/go/solutions/countif.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func CountIf(f func(string) bool, arr []string) int {
 	counter := 0

tests/go/solutions/createelem.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 type Node struct {
 	Data int

tests/go/solutions/divmod.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func DivMod(a, b int, div, mod *int) {
 	*div = a / b

tests/go/solutions/doppelganger.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strings"
 

tests/go/solutions/doppelgangerprog/test_doppelgangerprog.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 type node struct {
@@ -47,6 +47,6 @@ func main() {
 	}
 
 	for _, arg := range table {
-		z01.Challenge("DoppelGangerProg", DoppelGanger, solutions.DoppelGanger, arg.big, arg.little)
+		z01.Challenge("DoppelGangerProg", DoppelGanger, correct.DoppelGanger, arg.big, arg.little)
 	}
 }

tests/go/solutions/eightqueens.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "github.com/01-edu/z01"
 

tests/go/solutions/enigma.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // this function will put a in c; c in d; d in b and b in a
 func Enigma(a ***int, b *int, c *******int, d ****int) {

tests/go/solutions/fib.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func rec(a, b, cnt int) int {
 	if a > b {

tests/go/solutions/fib/test_fib.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -15,6 +15,6 @@ func main() {
 	}
 	table = append(table, z01.MultRandIntBetween(-100, 150)...)
 	for _, arg := range table {
-		z01.Challenge("Fib", Fib, solutions.Fib, arg)
+		z01.Challenge("Fib", Fib, correct.Fib, arg)
 	}
 }

tests/go/solutions/fibonacci.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func Fibonacci(value int) int {
 	if value < 0 {

tests/go/solutions/findnextprime.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "math"
 

tests/go/solutions/findprevprime.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func FindPrevPrime(nbr int) int {
 	if nbr < 2 {

tests/go/solutions/findprevprimeprog/test_findprevprimeprog.go

@@ -3,12 +3,12 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
 	a := append(z01.MultRandIntBetween(0, 99999), 5, 4, 1)
 	for _, elem := range a {
-		z01.Challenge("FindPrevPrimeProg", FindPrevPrime, solutions.FindPrevPrime, elem)
+		z01.Challenge("FindPrevPrimeProg", FindPrevPrime, correct.FindPrevPrime, elem)
 	}
 }

tests/go/solutions/firstrune.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func FirstRune(s string) rune {
 	runes := []rune(s)

tests/go/solutions/firstruneprog/test_firstruneprog.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -15,6 +15,6 @@ func main() {
 		"♥01",
 	)
 	for _, arg := range table {
-		z01.Challenge("FirstRuneProg", FirstRune, solutions.FirstRune, arg)
+		z01.Challenge("FirstRuneProg", FirstRune, correct.FirstRune, arg)
 	}
 }

tests/go/solutions/foldint.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "fmt"
 

tests/go/solutions/foldint/test_foldint.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -41,7 +41,7 @@ func main() {
 
 	for _, v := range table {
 		for _, f := range v.functions {
-			z01.Challenge("FoldInt", FoldInt, solutions.FoldInt, f, v.arr, v.n)
+			z01.Challenge("FoldInt", FoldInt, correct.FoldInt, f, v.arr, v.n)
 		}
 	}
 }

tests/go/solutions/foreach.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func ForEach(f func(int), a []int) {
 	for _, el := range a {

tests/go/solutions/foreachprog/test_foreachprog.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func add0(i int) {
@@ -46,6 +46,6 @@ func main() {
 	})
 
 	for _, arg := range table {
-		z01.Challenge("ForEachProg", ForEach, solutions.ForEach, arg.f, arg.a)
+		z01.Challenge("ForEachProg", ForEach, correct.ForEach, arg.f, arg.a)
 	}
 }

tests/go/solutions/game23.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func Game23(a, b int) int {
 	if a > b {

tests/go/solutions/game23/test_game23.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func nd(a, b int) int {
@@ -55,6 +55,6 @@ func main() {
 		table = append(table, value)
 	}
 	for _, arg := range table {
-		z01.Challenge("Game23", Game23, solutions.Game23, arg.init, arg.fin)
+		z01.Challenge("Game23", Game23, correct.Game23, arg.init, arg.fin)
 	}
 }

tests/go/solutions/halfcontest.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func Halfcontest(h1, m1, h2, m2 int) int {
 	t1 := h1*60 + m1

tests/go/solutions/halfcontestprog/test_halfcontestprog.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -28,6 +28,6 @@ func main() {
 	}
 
 	for _, arg := range table {
-		z01.Challenge("HalfContestProg", Halfcontest, solutions.Halfcontest, arg.h1, arg.m1, arg.h2, arg.m2)
+		z01.Challenge("HalfContestProg", Halfcontest, correct.Halfcontest, arg.h1, arg.m1, arg.h2, arg.m2)
 	}
 }

tests/go/solutions/index.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strings"
 

tests/go/solutions/interestingnumber.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func isInteresting(n int) bool {
 	s := 0

tests/go/solutions/interestingnumber/test_interestingnumber.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -16,6 +16,6 @@ func main() {
 	table = append(table, z01.MultRandIntBetween(1, 1500)...)
 
 	for _, arg := range table {
-		z01.Challenge("InterestingNumber", InterestingNumber, solutions.InterestingNumber, arg)
+		z01.Challenge("InterestingNumber", InterestingNumber, correct.InterestingNumber, arg)
 	}
 }

tests/go/solutions/inverttree.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 type TNode struct {
 	Val   int

tests/go/solutions/inverttree/test_inverttree.go

@@ -8,11 +8,11 @@ import (
 
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 type stuNode = TNode
-type solNode = solutions.TNode
+type solNode = correct.TNode
 
 func solInsert(N *solNode, newVal int) {
 	if N == nil {
@@ -140,7 +140,7 @@ func main() {
 		solInsert(tree, val3)
 		solInsert(tree, val4)
 		// solPrint(os.Stdout, tree, 0, 'M')
-		solutions.InvertTree(tree)
+		correct.InvertTree(tree)
 		// solPrint(os.Stdout, tree, 0, 'M')
 
 		TestTree = &stuNode{Val: root, Left: nil, Right: nil}

tests/go/solutions/isalpha.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "unicode"
 

tests/go/solutions/isanagram.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func IsAnagram(s, t string) bool {
 	alph := make([]int, 26)

tests/go/solutions/isanagram/test_isanagram.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -33,6 +33,6 @@ func main() {
 	}
 
 	for _, arg := range table {
-		z01.Challenge("IsAnagram", IsAnagram, solutions.IsAnagram, arg[0], arg[1])
+		z01.Challenge("IsAnagram", IsAnagram, correct.IsAnagram, arg[0], arg[1])
 	}
 }

tests/go/solutions/islower.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "unicode"
 

tests/go/solutions/isnegative.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "fmt"
 

tests/go/solutions/isnumeric.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "unicode"
 

tests/go/solutions/isprime.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "math"
 

tests/go/solutions/isprintable.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "unicode"
 

tests/go/solutions/issorted.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func IsSorted(f func(int, int) int, arr []int) bool {
 	ascendingOrdered := true

tests/go/solutions/isupper.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func IsUpper(s string) bool {
 	for _, r := range s {

tests/go/solutions/iterativefactorial.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "math/bits"
 

tests/go/solutions/iterativepower.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "math"
 

tests/go/solutions/itoa.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strconv"
 

tests/go/solutions/itoabase.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import (
 	"strconv"

tests/go/solutions/itoabaseprog/main.go

@@ -3,11 +3,10 @@ package main
 import (
 	"fmt"
 	"strconv"
+	"strings"
 
 	"github.com/01-edu/z01"
 
-	"strings"
-
 	student "../../student"
 )
 

tests/go/solutions/itoabaseprog/test_itoabaseprog.go

@@ -3,18 +3,18 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
 	for i := 0; i < 30; i++ {
 		value := z01.RandIntBetween(-1000000, 1000000)
 		base := z01.RandIntBetween(2, 16)
-		z01.Challenge("ItoaBaseProg", ItoaBase, solutions.ItoaBase, value, base)
+		z01.Challenge("ItoaBaseProg", ItoaBase, correct.ItoaBase, value, base)
 	}
 	for i := 0; i < 5; i++ {
 		base := z01.RandIntBetween(2, 16)
-		z01.Challenge("ItoaBaseProg", ItoaBase, solutions.ItoaBase, z01.MaxInt, base)
+		z01.Challenge("ItoaBaseProg", ItoaBase, correct.ItoaBase, z01.MaxInt, base)
-		z01.Challenge("ItoaBaseProg", ItoaBase, solutions.ItoaBase, z01.MinInt, base)
+		z01.Challenge("ItoaBaseProg", ItoaBase, correct.ItoaBase, z01.MinInt, base)
 	}
 }

tests/go/solutions/itoaprog/test_itoaprog.go

@@ -3,12 +3,12 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
 	for i := 0; i < 50; i++ {
 		arg := z01.RandIntBetween(-2000000000, 2000000000)
-		z01.Challenge("ItoaProg", Itoa, solutions.Itoa, arg)
+		z01.Challenge("ItoaProg", Itoa, correct.Itoa, arg)
 	}
 }

tests/go/solutions/join.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "strings"
 

tests/go/solutions/lastrune.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func LastRune(s string) rune {
 	runes := []rune(s)

tests/go/solutions/lastruneprog/test_lastruneprog.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -15,6 +15,6 @@ func main() {
 		z01.RandStr(z01.RandIntBetween(1, 15), z01.RandAlnum()),
 	)
 	for _, arg := range table {
-		z01.Challenge("LastRuneProg", LastRune, solutions.LastRune, arg)
+		z01.Challenge("LastRuneProg", LastRune, correct.LastRune, arg)
 	}
 }

tests/go/solutions/lcm.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func gcd(first, second int) int {
 	if second == 0 {

tests/go/solutions/lcm/test_lcm.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -23,6 +23,6 @@ func main() {
 	}
 
 	for _, arg := range table {
-		z01.Challenge("Lcm", Lcm, solutions.Lcm, arg[0], arg[1])
+		z01.Challenge("Lcm", Lcm, correct.Lcm, arg[0], arg[1])
 	}
 }

tests/go/solutions/listat.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // returs the node in a given position
 func ListAt(l *NodeL, nbr int) *NodeL {

tests/go/solutions/listclear.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func ListClear(l *List) {
 	temp := l.Head

tests/go/solutions/listfind.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // finds the element and returns the first data from the node that is a string
 func ListFind(l *List, ref interface{}, comp func(a, b interface{}) bool) *interface{} {

tests/go/solutions/listforeach.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // applies a function in argument to each element of the linked list
 func ListForEach(l *List, f func(*NodeL)) {

tests/go/solutions/listforeachif.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // compare each element of the linked list to see if it is a String
 func IsPositive_node(node *NodeL) bool {

tests/go/solutions/listlast.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // gives the last element of the list
 func ListLast(l *List) interface{} {

tests/go/solutions/listmerge.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // merges the 2 lists in one (in the end of the first list)
 func ListMerge(l1 *List, l2 *List) {

tests/go/solutions/listpushback.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 type NodeL struct {
 	Data interface{}

tests/go/solutions/listpushfront.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // inserts node on the first position of the list
 func ListPushFront(l *List, data interface{}) {

tests/go/solutions/listremoveif.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 // removes all elements that are equal to the data_ref
 func ListRemoveIf(l *List, data_ref interface{}) {

tests/go/solutions/listremoveifprog/test_listremoveifprog.go

@@ -5,12 +5,12 @@ import (
 
 	"github.com/01-edu/z01"
 
-	solution "../../solutions"
+	correct "./correct"
 )
 
 type Node10 = NodeL
-type List10 = solution.List
+type List10 = correct.List
-type NodeS10 = solution.NodeL
+type NodeS10 = correct.NodeL
 type ListS10 = List
 
 func listToStringStu12(l *ListS10) string {
@@ -56,11 +56,11 @@ func comparFuncList10(l1 *List10, l2 *ListS10, data interface{}) {
 	for l1.Head != nil || l2.Head != nil {
 		if (l1.Head == nil && l2.Head != nil) || (l1.Head != nil && l2.Head == nil) {
 			z01.Fatalf("\ndata used: %v\nstudent list:%s\nlist:%s\n\nListRemoveIf() == %v instead of %v\n\n",
-				data, listToStringStu12(l2), solution.ListToString(l1.Head), l2.Head, l1.Head)
+				data, listToStringStu12(l2), correct.ListToString(l1.Head), l2.Head, l1.Head)
 		}
 		if l1.Head.Data != l2.Head.Data {
 			z01.Fatalf("\ndata used: %v\nstudent list:%s\nlist:%s\n\nListRemoveIf() == %v instead of %v\n\n",
-				data, listToStringStu12(l2), solution.ListToString(l1.Head), l2.Head.Data, l1.Head.Data)
+				data, listToStringStu12(l2), correct.ListToString(l1.Head), l2.Head.Data, l1.Head.Data)
 		}
 		l1.Head = l1.Head.Next
 		l2.Head = l2.Head.Next
@@ -71,12 +71,12 @@ func comparFuncList10(l1 *List10, l2 *ListS10, data interface{}) {
 func main() {
 	link1 := &List10{}
 	link2 := &ListS10{}
-	table := []solution.NodeTest{}
+	table := []correct.NodeTest{}
 
-	table = solution.ElementsToTest(table)
+	table = correct.ElementsToTest(table)
 
 	table = append(table,
-		solution.NodeTest{
+		correct.NodeTest{
 			Data: []interface{}{"hello", "hello1", "hello2", "hello3"},
 		},
 	)
@@ -91,11 +91,11 @@ func main() {
 		if link1.Head != nil && link2.Head != nil {
 			cho := arg.Data[index]
 			ListRemoveIf(link2, cho)
-			solution.ListRemoveIf(link1, cho)
+			correct.ListRemoveIf(link1, cho)
 			comparFuncList10(link1, link2, cho)
 		} else {
 			ListRemoveIf(link2, 1)
-			solution.ListRemoveIf(link1, 1)
+			correct.ListRemoveIf(link1, 1)
 			comparFuncList10(link1, link2, 1)
 		}
 

tests/go/solutions/listreverse.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func ListReverse(l *List) {
 	current := l.Head

tests/go/solutions/listsize.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func ListSize(l *List) int {
 	count := 0

tests/go/solutions/listsizeprog/test_listsizeprog.go

@@ -1,13 +1,14 @@
 package main
 
 import (
-	solution "../../solutions"
 	"github.com/01-edu/z01"
+
+	correct "./correct"
 )
 
 type Node2 = NodeL
-type List2 = solution.List
+type List2 = correct.List
-type NodeS2 = solution.NodeL
+type NodeS2 = correct.NodeL
 type ListS2 = List
 
 func listPushBackTest2(l *ListS2, l1 *List2, data interface{}) {
@@ -37,10 +38,10 @@ func listPushBackTest2(l *ListS2, l1 *List2, data interface{}) {
 func main() {
 	link := &List2{}
 	link2 := &ListS2{}
-	table := []solution.NodeTest{}
+	table := []correct.NodeTest{}
-	table = solution.ElementsToTest(table)
+	table = correct.ElementsToTest(table)
 	table = append(table,
-		solution.NodeTest{
+		correct.NodeTest{
 			Data: []interface{}{"Hello", "man", "how are you"},
 		},
 	)
@@ -48,10 +49,10 @@ func main() {
 		for i := 0; i < len(arg.Data); i++ {
 			listPushBackTest2(link2, link, arg.Data[i])
 		}
-		aux := solution.ListSize(link)
+		aux := correct.ListSize(link)
 		aux2 := ListSize(link2)
 		if aux != aux2 {
-			z01.Fatalf("ListSize(%v) == %d instead of %d\n", solution.ListToString(link.Head), aux2, aux)
+			z01.Fatalf("ListSize(%v) == %d instead of %d\n", correct.ListToString(link.Head), aux2, aux)
 		}
 		link = &List2{}
 		link2 = &ListS2{}

tests/go/solutions/listsort.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func ListSort(l *NodeI) *NodeI {
 	head := l

tests/go/solutions/makerange.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func MakeRange(min, max int) []int {
 	size := max - min

tests/go/solutions/map.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func IsPositive(value int) bool {
 	return value > 0

tests/go/solutions/max.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 import "sort"
 

tests/go/solutions/maxprog/test_maxprog.go

@@ -3,7 +3,7 @@ package main
 import (
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 func main() {
@@ -13,5 +13,5 @@ func main() {
 		args = append(args, z01.RandInt())
 	}
 
-	z01.Challenge("MaxProg", Max, solutions.Max, args)
+	z01.Challenge("MaxProg", Max, correct.Max, args)
 }

tests/go/solutions/merge.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 type TreeNodeM struct {
 	Left  *TreeNodeM

tests/go/solutions/merge/test_merge.go

@@ -6,11 +6,11 @@ import (
 
 	"github.com/01-edu/z01"
 
-	solutions "../../solutions"
+	correct "./correct"
 )
 
 type stuTreeNode = TreeNodeM
-type solTreeNode = solutions.TreeNodeM
+type solTreeNode = correct.TreeNodeM
 
 func New(n, k int) (*solTreeNode, *stuTreeNode, *solTreeNode) {
 	var cop *solTreeNode
@@ -166,7 +166,7 @@ func main() {
 		cop1, stuTree1, solTree1 := New(arg.n, arg.k)
 		cop2, stuTree2, solTree2 := New(arg.n, arg.k)
 		stuResult := MergeTrees(stuTree1, stuTree2)
-		solResult := solutions.MergeTrees(solTree1, solTree2)
+		solResult := correct.MergeTrees(solTree1, solTree2)
 
 		compareTrees(stuResult, solResult, cop1, cop2)
 	}

tests/go/solutions/nauuo.go

@@ -1,4 +1,4 @@
-package solutions
+package correct
 
 func Nauuo(plus, minus, rand int) string {
 	if rand == 0 {