exercise-6: Kemalatdin Galymzhan

.gitignore

@@ -25,3 +25,4 @@ go.work
 
 # Students
 students.txt
+.env

exercise1/problem1/main.go

@@ -1,3 +1,9 @@
 package main
 
-func addUp() {}
+func addUp(num int) int {
+	sum := 0
+	for i := 1; i <= num; i++ {
+		sum = sum + i
+	}
+	return sum
+}

exercise1/problem10/main.go

@@ -1,3 +1,15 @@
 package main
 
-func sum() {}
+import (
+	"errors"
+	"strconv"
+)
+
+func sum(a string, b string) (string, error) {
+	sA, errA := strconv.Atoi(a)
+	sB, errB := strconv.Atoi(b)
+	if errA != nil || errB != nil {
+		return "", errors.Join(errA, errB)
+	}
+	return strconv.Itoa(sA + sB), nil
+}

exercise1/problem2/main.go

@@ -1,3 +1,7 @@
 package main
 
-func binary() {}
+import "fmt"
+
+func binary(num int) string {
+	return fmt.Sprintf("%b", num)
+}

exercise1/problem3/main.go

@@ -1,3 +1,9 @@
 package main
 
-func numberSquares() {}
+func numberSquares(num int) int {
+	var result int
+	for i := 1; i <= num; i++ {
+		result = result + (i * i)
+	}
+	return result
+}

exercise1/problem4/main.go

@@ -1,3 +1,15 @@
 package main
 
-func detectWord() {}
+import (
+	"unicode"
+)
+
+func detectWord(crowd string) string {
+	var result string
+	for _, s := range crowd {
+		if !unicode.IsUpper(s) {
+			result = result + string(s)
+		}
+	}
+	return result
+}

exercise1/problem5/main.go

@@ -1,3 +1,12 @@
 package main
 
-func potatoes() {}
+func potatoes(crowd string) int {
+	var result int
+	strL := len("potato")
+	for i := 0; i <= len(crowd)-strL; i++ {
+		if crowd[i:i+strL] == "potato" {
+			result++
+		}
+	}
+	return result
+}

exercise1/problem6/main.go

@@ -1,3 +1,19 @@
 package main
 
-func emojify() {}
+import "strings"
+
+var emoji = map[string]string{
+	"smile": "🙂",
+	"grin":  "😀",
+	"sad":   "😥",
+	"mad":   "😠",
+}
+
+func emojify(text string) string {
+	for i, v := range emoji {
+		if strings.Contains(text, i) {
+			text = strings.Replace(text, i, v, 1)
+		}
+	}
+	return text
+}

exercise1/problem7/main.go

@@ -1,3 +1,21 @@
 package main
 
-func highestDigit() {}
+import "slices"
+
+func highestDigit(num int) int {
+	if num != 0 {
+		numS := ItoSlice(num)
+		return slices.Max(numS)
+	}
+	return 0
+}
+
+func ItoSlice(n int) []int {
+	var numS []int
+	for n >= 1 {
+		i := n % 10
+		numS = append(numS, i)
+		n = n / 10
+	}
+	return numS
+}

exercise1/problem8/main.go

@@ -1,3 +1,12 @@
 package main
 
-func countVowels() {}
+func countVowels(text string) int {
+	var count int
+	for _, v := range text {
+		switch v {
+		case 'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U':
+			count++
+		}
+	}
+	return count
+}

exercise1/problem9/main.go

@@ -1,7 +1,13 @@
 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
+}

exercise2/problem1/problem1.go

@@ -1,4 +1,11 @@
 package problem1
 
-func isChangeEnough() {
+var cents = []float32{0.25, 0.10, 0.05, 0.01}
+
+func isChangeEnough(changes [4]int, total float32) bool {
+	var sum float32
+	for key, index := range changes {
+		sum += cents[key] * float32(index)
+	}
+	return sum >= total
 }

exercise2/problem10/problem10.go

@@ -1,3 +1,11 @@
 package problem10
 
-func factory() {}
+func factory() (map[string]int, func(brand string) func(int)) {
+	result := make(map[string]int)
+	return result, func(brand string) func(int) {
+		result[brand] = 0
+		return func(i int) {
+			result[brand] = result[brand] + i
+		}
+	}
+}

exercise2/problem11/problem11.go

@@ -1,3 +1,13 @@
 package problem11
 
-func removeDups() {}
+import "slices"
+
+func removeDups[T comparable](nums []T) []T {
+	result := make([]T, 0)
+	for _, v := range nums {
+		if !slices.Contains(result, v) {
+			result = append(result, v)
+		}
+	}
+	return result
+}

exercise2/problem12/problem12.go

@@ -1,3 +1,32 @@
 package problem11
 
-func keysAndValues() {}
+import (
+	"fmt"
+	"sort"
+)
+
+func keysAndValues[K comparable, V any](m map[K]V) ([]K, []V) {
+	if m == nil {
+		return []K{}, []V{}
+	}
+
+	keys := make([]K, 0, len(m))
+	for k := range m {
+		keys = append(keys, k)
+	}
+
+	sort.Slice(keys, func(i, j int) bool {
+		return stringify(keys[i]) < stringify(keys[j])
+	})
+
+	values := make([]V, len(keys))
+	for i, k := range keys {
+		values[i] = m[k]
+	}
+
+	return keys, values
+}
+
+func stringify[T any](v T) string {
+	return fmt.Sprintf("%v", v)
+}

exercise2/problem2/problem2.go

@@ -1,4 +1,15 @@
 package problem2
 
-func capitalize() {
+import "strings"
+
+func capitalize(names []string) []string {
+	for i, v := range names {
+		if v == "" {
+			continue
+		}
+		firstLetter := strings.ToUpper(string(v[0]))
+		lowerS := strings.ToLower(v[1:])
+		names[i] = firstLetter + lowerS
+	}
+	return names
 }

exercise2/problem3/problem3.go

@@ -9,5 +9,43 @@ const (
 	lr dir = "lr"
 )
 
-func diagonalize() {
+func diagonalize(n int, d dir) [][]int {
+	matrix := make([][]int, n)
+	switch d {
+	case ul:
+		count := 0
+		getMatrix(count, matrix, n, true, true)
+		break
+	case ll:
+		count := n - 1
+		getMatrix(count, matrix, n, true, false)
+		break
+	case ur:
+		count := n - 1
+		getMatrix(count, matrix, n, false, true)
+		break
+	case lr:
+		count := (n - 1) * 2
+		getMatrix(count, matrix, n, false, false)
+		break
+	}
+	return matrix
+}
+
+func getMatrix(count int, matrix [][]int, n int, o bool, countChecker bool) {
+	for i := range n {
+		matrix[i] = make([]int, n)
+		for j := range n {
+			if o {
+				matrix[i][j] = count + j
+			} else {
+				matrix[i][j] = count - j
+			}
+		}
+		if countChecker {
+			count++
+		} else {
+			count--
+		}
+	}
 }

exercise2/problem4/problem4.go

@@ -1,4 +1,11 @@
 package problem4
 
-func mapping() {
+import "strings"
+
+func mapping(inp []string) map[string]string {
+	intM := make(map[string]string)
+	for _, v := range inp {
+		intM[v] = strings.ToUpper(v)
+	}
+	return intM
 }

exercise2/problem5/problem5.go

@@ -1,4 +1,45 @@
 package problem5
 
-func products() {
+import "sort"
+
+type Catalog struct {
+	Key   string
+	Value int
+}
+
+type CatalogList []Catalog
+
+func (c CatalogList) Len() int {
+	return len(c)
+}
+
+func (c CatalogList) Less(i, j int) bool {
+	if c[i].Value == c[j].Value {
+		return c[i].Key < c[j].Key
+	}
+	return c[i].Value > c[j].Value
+}
+
+func (c CatalogList) Swap(i, j int) {
+	c[i], c[j] = c[j], c[i]
+}
+
+func products(catalog map[string]int, minPrice int) []string {
+	prices := make(CatalogList, len(catalog))
+	i := 0
+
+	for k, v := range catalog {
+		if v > minPrice {
+			prices[i] = Catalog{k, v}
+			i++
+		}
+	}
+	sort.Sort(prices)
+	result := make([]string, 0)
+	for _, v := range prices {
+		if v.Key != "" {
+			result = append(result, v.Key)
+		}
+	}
+	return result
 }

exercise2/problem6/problem6.go

@@ -1,4 +1,12 @@
 package problem6
 
-func sumOfTwo() {
+func sumOfTwo(first []int, second []int, sum int) bool {
+	for _, fv := range first {
+		for _, sv := range second {
+			if fv+sv == 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,12 @@ 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
 	}
 }