@ -3,8 +3,8 @@ package main
import (
"strconv"
"../lib"
"./correct"
"github.com/01-edu/public/go/lib"
)
type stuNode = NodeAddL
@ -1,10 +1,10 @@
package main
"./base"
"./student"
// this is the function that creates the TESTS
@ -1,9 +1,9 @@
func parentListDelete(root *student.TreeNode) string {
func parentListInsert(root *student.TreeNode) string {
@ -3,9 +3,9 @@ package main
"reflect"
func BTreeMinStu(root *student.TreeNode) *student.TreeNode {
func errorMessage_level(fn interface{}, root, a *correct.TreeNode, b *student.TreeNode) {
func errorMessage_max(fn interface{}, root, a *correct.TreeNode, b *student.TreeNode) {
func errorMessage_min(fn interface{}, root, a *correct.TreeNode, b *student.TreeNode) {
"fmt"
func errorMessage_search(fn interface{}, root, a *correct.TreeNode, b *student.TreeNode,
func parentListTransp(root *student.TreeNode) string {
func main() {
type Node5 = student.NodeL
type Node4 = student.NodeL
type Node9 = student.NodeL
type Node7 = student.NodeL
type Node8 = student.NodeL
type Node3 = student.NodeL
type Node11 = student.NodeL
type ListS = correct.List
type ListSa = correct.List
type Node10 = student.NodeL
type Node6 = student.NodeL
type Node2 = student.NodeL
type NodeI12 = student.NodeI
type NodeI13 = student.NodeI
type NodeI14 = student.NodeI
@ -1,8 +1,8 @@
@ -1,6 +1,6 @@
import "../lib"
import "github.com/01-edu/public/go/lib"
lib.ChallengeMain("pilot")
@ -3,9 +3,8 @@ package main
"sort"
"github.com/01-edu/public/tests/go/lib"
// Receives 5 ints and returns the number in the middle
@ -1,6 +1,9 @@
import "./student"
// Function that return the number of active bits in the number passed as the argument
func activeBits(n int) (total int) {
@ -3,7 +3,7 @@ package main
func isAPrime(nb int) bool {
@ -6,6 +6,7 @@ import (
"strings"
func advancedSortWordArr(a []string, f func(a, b string) int) {
@ -4,6 +4,7 @@ import (
"unicode"
func alphaCount(s string) (i int) {
@ -1,6 +1,8 @@
args := [][]string{
@ -3,6 +3,7 @@ package main
"../common"
func any(f func(string) bool, arr []string) bool {
func appendRange(min, max int) []int {
size := max - min
func atoi(s string) int {
table := []string{
func basicAtoi(s string) int {
func basicAtoi2(s string) int {
func basicJoin(a []string) (b string) {
for _, s := range a {
oneArgs := []string{
@ -5,6 +5,7 @@ import (
func capitalize(s string) string {
@ -6,7 +6,7 @@ import (
"os/exec"
func chunk(a []int, ch int) {
args := []string{
func collatzCountdown(start int) int {
if start <= 0 {
func compact(slice *[]string) int {
func compare(a, b string) int {
func concat(a, b string) string {
return a + b
func concatParams(args []string) string {
type node struct {
lib.ChallengeMain("countdown")
func countIf(f func(string) bool, arr []string) int {
lib.ChallengeMain("displayalpham")
lib.ChallengeMain("displayalrevm")
@ -4,7 +4,7 @@ import (
"os"
func DivMod(a, b int, div, mod *int) {
*div = a / b
@ -1,11 +1,10 @@
func doppelGanger(s, substr string) int {
const size = 8
// 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) {
func fib(n int) int {
if n <= 0 {
func fibonacci(value int) int {
if value < 0 {
func findNextPrime(nb int) int {
func findPrevPrime(nb int) int {
func firstRune(s string) rune {
runes := []rune(s)
table := append(lib.MultRandWords(),
lib.ChallengeMain("fixthemain")
flags []string
func foldInt(f func(int, int) int, a []int, n int) {
func forEach(f func(int), a []int) {
func game23(a, b int) int {
if a > b {
func validRegExp(n int) string {
result := "("
func halfContest(h1, m1, h2, m2 int) int {
t1 := h1*60 + m1
lib.ChallengeMain("hello")
args := [][2]string{
func index(s string, substr string) int {
func isInteresting(n int) bool {
s := 0
func isAlpha(s string) bool {
func isAnagram(s, t string) bool {
alph := make([]int, 26)
func isNegative(n int) {
func isPrintable(s string) bool {