Ruslan kambarov exercise 7

exercise1/problem1/main.go

@@ -1,3 +1,10 @@
 package main
 
-func addUp() {}
+func addUp(x int) int {
+	var c int = 0
+	var i int
+	for i = 1; i <= x; i++ {
+		c += i
+	}
+	return c
+}

exercise1/problem10/main.go

@@ -1,3 +1,19 @@
 package main
 
-func sum() {}
+import (
+	"errors"
+	"fmt"
+	"strconv"
+)
+
+func sum(a, b string) (string, error) {
+	sum1, err := strconv.Atoi(a)
+	if err != nil {
+		return "", errors.New("string: a cannot be converted")
+	}
+	sum2, err := strconv.Atoi(b)
+	if err != nil {
+		return "", errors.New("string: b cannot be converted")
+	}
+	return fmt.Sprintf("%v", sum1+sum2), nil
+}

exercise1/problem2/main.go

@@ -1,3 +1,15 @@
 package main
 
-func binary() {}
+import "fmt"
+
+func binary(x int) string {
+	var result string
+	if x == 0 {
+		return "0"
+	}
+	for x > 0 {
+		result = fmt.Sprintf("%v", x%2) + result
+		x = x / 2
+	}
+	return result
+}

exercise1/problem3/main.go

@@ -1,3 +1,10 @@
 package main
 
-func numberSquares() {}
+func numberSquares(x int) int {
+	var ac int
+	for x > 0 {
+		ac += x * x
+		x -= 1
+	}
+	return ac
+}

exercise1/problem4/main.go

@@ -1,3 +1,13 @@
 package main
 
-func detectWord() {}
+import "unicode"
+
+func detectWord(str string) string {
+	var result string
+	for _, ch := range str {
+		if unicode.IsLower(ch) {
+			result += string(ch)
+		}
+	}
+	return result
+}

exercise1/problem5/main.go

@@ -1,3 +1,7 @@
 package main
 
-func potatoes() {}
+import "strings"
+
+func potatoes(str string) int {
+	return strings.Count(str, "potato")
+}

exercise1/problem6/main.go

@@ -1,3 +1,22 @@
 package main
 
-func emojify() {}
+import "strings"
+
+func emojify(str string) string {
+	return strings.Replace(
+		strings.Replace(
+			strings.Replace(
+				strings.Replace(str, "smile", "🙂", -1),
+				"grin",
+				"😀",
+				-1,
+			),
+			"sad",
+			"😥",
+			-1,
+		),
+		"mad",
+		"😠",
+		-1,
+	)
+}

exercise1/problem7/main.go

@@ -1,3 +1,13 @@
 package main
 
-func highestDigit() {}
+func highestDigit(num int) int {
+	var max int = 0
+	for num > 1 {
+		cur := num % 10
+		num = num / 10
+		if cur > max {
+			max = cur
+		}
+	}
+	return max
+}

exercise1/problem8/main.go

@@ -1,3 +1,12 @@
 package main
 
-func countVowels() {}
+import "strings"
+
+func countVowels(str string) int {
+	var c int = 0
+	var vowels = []string{"a", "e", "i", "o", "u"}
+	for _, ch := range vowels {
+		c += strings.Count(str, ch)
+	}
+	return c
+}

exercise1/problem9/main.go

@@ -1,7 +1,26 @@
 package main
 
-func bitwiseAND() {}
+func bitwiseAND(a int, b int) int {
+	return a & b
+}
 
-func bitwiseOR() {}
+func bitwiseOR(a int, b int) int {
+	return a | b
+}
 
-func bitwiseXOR() {}
+func bitwiseXOR(a int, b int) int {
+	return a ^ b
+}
+
+// func bitwise(a int) string {
+// 	var result string
+// 	for i := 0; i < 8; i++ {
+// 		if a > 0 {
+// 			result = fmt.Sprintf("%v", a%2) + result
+// 			a = a / 2
+// 		} else {
+// 			result = "0" + result
+// 		}
+// 	}
+// 	return result
+// }

exercise2/problem1/problem1.go

@@ -1,4 +1,5 @@
 package problem1
 
-func isChangeEnough() {
+func isChangeEnough(coins [4]int, cost float32) bool {
+	return (float32(coins[0])*0.25 + float32(coins[1])*0.10 + float32(coins[2])*0.05 + float32(coins[3])*0.01) >= cost
 }

exercise2/problem10/problem10.go

@@ -1,3 +1,12 @@
 package problem10
 
-func factory() {}
+func factory() (map[string]int, func(string) func(int)) {
+	m := map[string]int{}
+	f := func(model string) func(int) {
+		m[model] = 0
+		return func(inc int) {
+			m[model] += inc
+		}
+	}
+	return m, f
+}

exercise2/problem11/problem11.go

@@ -1,3 +1,19 @@
 package problem11
 
-func removeDups() {}
+func removeDups[T int | bool | string](sl []T) []T {
+	var result []T
+	var l bool = false
+	for i, a := range sl {
+		l = false
+		for _, b := range result {
+			if a == b {
+				l = true
+				break
+			}
+		}
+		if l == false {
+			result = append(result, sl[i])
+		}
+	}
+	return result
+}

exercise2/problem12/problem12.go

@@ -1,3 +1,23 @@
 package problem11
 
-func keysAndValues() {}
+import (
+	"slices"
+)
+
+func keysAndValues[T int | string, P int | bool | string](m map[T]P) ([]T, []P) {
+
+	var keys []T
+	var values []P
+	for key, value := range m {
+		keys = append(keys, key)
+		values = append(values, value)
+	}
+
+	slices.SortFunc(keys, func(a, b T) int {
+		if a > b {
+			return 1
+		}
+		return -1
+	})
+	return keys, values
+}

exercise2/problem2/problem2.go

@@ -1,4 +1,19 @@
 package problem2
 
-func capitalize() {
+import (
+	"strings"
+	"unicode"
+)
+
+func capitalize(names []string) []string {
+	for i, name := range names {
+		names[i] = strings.ToLower(name)
+		r := []rune(names[i])
+		if len(r) == 0 {
+			continue
+		}
+		r[0] = unicode.ToUpper(r[0])
+		names[i] = string(r)
+	}
+	return names
 }

exercise2/problem3/problem3.go

@@ -9,5 +9,22 @@ const (
 	lr dir = "lr"
 )
 
-func diagonalize() {
+func diagonalize(d int, direction dir) [][]int {
+	matrix := make([][]int, d)
+	for i := 0; i < d; i++ {
+		matrix[i] = make([]int, d)
+		for j := 0; j < d; j++ {
+			switch {
+			case direction == ul:
+				matrix[i][j] = j + i
+			case direction == lr:
+				matrix[i][j] = (d-1)*2 - i - j
+			case direction == ur:
+				matrix[i][j] = (d - 1) + i - j
+			case direction == ll:
+				matrix[i][j] = (d - 1) + j - i
+			}
+		}
+	}
+	return matrix
 }

exercise2/problem4/problem4.go

@@ -1,4 +1,13 @@
 package problem4
 
-func mapping() {
+import (
+	"strings"
+)
+
+func mapping(arr []string) map[string]string {
+	result := map[string]string{}
+	for _, value := range arr {
+		result[value] = strings.ToUpper(value)
+	}
+	return result
 }

exercise2/problem5/problem5.go

@@ -1,4 +1,21 @@
 package problem5
 
-func products() {
+import "sort"
+
+func products(m map[string]int, price int) []string {
+	result := []string{}
+	for key, val := range m {
+		if val > price {
+			result = append(result, key)
+		}
+	}
+
+	sort.Slice(result, func(i, j int) bool {
+		if m[result[i]] == m[result[j]] {
+			return result[i] < result[j]
+		}
+		return m[result[i]] > m[result[j]]
+	})
+
+	return result
 }

exercise2/problem6/problem6.go

@@ -1,4 +1,12 @@
 package problem6
 
-func sumOfTwo() {
+func sumOfTwo(a []int, b []int, sum int) bool {
+	for _, val1 := range a {
+		for _, val2 := range b {
+			if val1+val2 == sum {
+				return true
+			}
+		}
+	}
+	return false
 }

exercise2/problem7/problem7.go

@@ -1,4 +1,5 @@
 package problem7
 
-func swap() {
+func swap(a *int, b *int) {
+	*a, *b = *b, *a
 }

exercise2/problem8/problem8.go

@@ -4,13 +4,13 @@ func simplify(list []string) map[string]int {
 	var indMap map[string]int
 
 	indMap = make(map[string]int)
-	load(&indMap, &list)
+	load(indMap, list)
 
 	return indMap
 }
 
-func load(m *map[string]int, students *[]string) {
-	for i, name := range *students {
-		(*m)[name] = i
+func load(m map[string]int, students []string) {
+	for i, name := range students {
+		m[name] = i
 	}
 }

exercise2/problem9/problem9.go

@@ -1,3 +1,12 @@
 package problem9
 
-func factory() {}
+func factory(a int) func(vals ...int) []int {
+	fun := func(vals ...int) []int {
+		for i, val := range vals {
+			vals[i] = val * a
+		}
+		return vals
+	}
+
+	return fun
+}