Aray Mankenov Solved ex6

exercise1/problem1/main.go

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

exercise1/problem10/main.go

@@ -1,3 +1,18 @@
 package main
 
-func sum() {}
+import "strconv"
+
+func sum(a, b string) (string, error) {
+
+	n1, err := strconv.Atoi(a)
+	if err != nil {
+		return "", err
+	}
+	n2, err := strconv.Atoi(b)
+	if err != nil {
+		return "", err
+	}
+	res:=n1+n2
+	return strconv.Itoa(res),nil
+}
+

exercise1/problem2/main.go

@@ -1,3 +1,19 @@
 package main
 
-func binary() {}
+import "fmt"
+
+func binary(num int) string {
+	if num == 0 {
+		return "0"
+	}
+	var binaryStr string
+	for num > 0 {
+		remainder := num % 2
+
+		binaryStr = fmt.Sprintf("%d", remainder) + binaryStr
+
+		num /= 2
+	}
+
+	return binaryStr
+}

exercise1/problem3/main.go

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

exercise1/problem4/main.go

@@ -1,3 +1,13 @@
 package main
 
-func detectWord() {}
+func detectWord(str string) string {
+    res := ""
+
+    for i := 0; i < len(str); i++ {
+        if str[i] >= 'a' && str[i] <= 'z' {
+            res = res + string(str[i])
+        }
+    }
+
+    return res
+}

exercise1/problem5/main.go

@@ -1,3 +1,16 @@
 package main
 
-func potatoes() {}
+func potatoes(input string) int {
+
+    str := "potato"
+    strLength := len(str)
+    count := 0
+
+    for i := 0; i <= len(input)-strLength; i++ {
+        if input[i:i+strLength] == str {
+            count++
+        }
+    }
+
+    return count
+}

exercise1/problem6/main.go

@@ -1,3 +1,27 @@
 package main
 
-func emojify() {}
+func emojify(input string) string {
+    runes := []rune(input)
+    result := make([]rune, 0, len(runes))
+
+    for i := 0; i < len(runes); {
+        if i+4 < len(runes) && string(runes[i:i+5]) == "smile" {
+            result = append(result, '🙂')
+            i += 5
+        } else if i+2 < len(runes) && string(runes[i:i+3]) == "sad" {
+            result = append(result, '😥')
+            i += 3
+        } else if i+3 < len(runes) && string(runes[i:i+4]) == "grin" {
+            result = append(result, '😀')
+            i += 4
+        } else if i+2 < len(runes) && string(runes[i:i+3]) == "mad" {
+            result = append(result, '😠')
+            i += 3
+        } else {
+            result = append(result, runes[i])
+            i++
+        }
+    }
+
+    return string(result)
+}

exercise1/problem7/main.go

@@ -1,3 +1,18 @@
 package main
 
-func highestDigit() {}
+func highestDigit(num int) int {
+
+	res := 0
+
+	for num > 0 {
+
+		n := num % 10
+
+		if n > res {
+
+			res = n
+		}
+		num = num / 10
+	}
+	return res
+}

exercise1/problem8/main.go

@@ -1,3 +1,11 @@
 package main
 
-func countVowels() {}
+func countVowels(input string) int {
+	count := 0
+	for i := 0; i < len(input); i++ {
+		if input[i] == 'a' || input[i] == 'e' || input[i] == 'i' || input[i] == 'o' || input[i] == 'u' {
+			count++
+		}
+	}
+	return count
+}

exercise1/problem9/main.go

@@ -1,7 +1,11 @@
 package main
 
-func bitwiseAND() {}
-
-func bitwiseOR() {}
-
-func bitwiseXOR() {}
+func bitwiseAND(a, b int) int {
+	return a & b
+}
+func bitwiseOR(a, b int) int {
+	return a | b
+}
+func bitwiseXOR(a, b int) int {
+	return a ^ b
+}

exercise2/problem1/problem1.go

@@ -1,4 +1,7 @@
 package problem1
 
-func isChangeEnough() {
+func isChangeEnough(arr [4]int, coast float32) bool {
+	sum := arr[0]*25 + arr[1]*10 + arr[2]*5 + arr[3]*1
+	cena := coast * 100
+	return sum >= int(cena)
 }

exercise2/problem10/problem10.go

@@ -1,3 +1,17 @@
 package problem10
 
-func factory() {}
+func factory() (map[string]int, func(brand string) func(int)) {
+	brands := make(map[string]int)
+
+	makeBrand := func(brand string) func(int) {
+		if _, exists := brands[brand]; !exists {
+			brands[brand] = 0
+		}
+
+		return func(count int) {
+			brands[brand] += count
+		}
+	}
+
+	return brands, makeBrand
+}

exercise2/problem11/problem11.go

@@ -1,3 +1,15 @@
 package problem11
 
-func removeDups() {}
+func removeDups[T comparable](list []T) []T {
+	seen := map[T]struct{}{}
+	output := make([]T, 0, len(list))
+	for _, v := range list {
+		if _, ok := seen[v]; ok {
+			continue
+		}
+		output = append(output, v)
+		seen[v] = struct{}{}
+	}
+
+	return output
+}

exercise2/problem12/problem12.go

@@ -1,3 +1,23 @@
 package problem11
 
-func keysAndValues() {}
+import "sort"
+
+func keysAndValues[K string | int, V comparable](mp map[K]V) ([]K, []V) {
+
+	keys := make([]K, 0, len(mp))
+	values := make([]V, 0, len(mp))
+
+	for k := range mp {
+		keys = append(keys, k)
+	}
+
+	sort.Slice(keys, func(i, j int) bool {
+		return keys[i] < keys[j]
+	})
+
+	for _, k := range keys {
+		values = append(values, mp[k])
+	}
+
+	return keys, values
+}

exercise2/problem2/problem2.go

@@ -1,4 +1,14 @@
 package problem2
 
-func capitalize() {
+import (
+	"strings"
+)
+
+func capitalize(names []string) []string {
+	capitalizedNames := make([]string, len(names))
+	for i, name := range names {
+
+		capitalizedNames[i] = strings.Title(strings.ToLower(name))
+	}
+	return capitalizedNames
 }

exercise2/problem3/problem3.go

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

exercise2/problem4/problem4.go

@@ -1,4 +1,9 @@
 package problem4
 
-func mapping() {
+func mapping(letters []string) map[string]string {
+	result := make(map[string]string)
+	for _, letter := range letters {
+		result[letter] = string(letter[0] - 32)
+	}
+	return result
 }

exercise2/problem5/problem5.go

@@ -1,4 +1,24 @@
 package problem5
 
-func products() {
+import (
+	"sort"
+)
+
+func products(productMap map[string]int, minPrice int) []string {
+	var filteredProducts []string
+
+	for product, price := range productMap {
+		if price >= minPrice {
+			filteredProducts = append(filteredProducts, product)
+		}
+	}
+
+	sort.Slice(filteredProducts, func(i, j int) bool {
+		if productMap[filteredProducts[i]] == productMap[filteredProducts[j]] {
+			return filteredProducts[i] < filteredProducts[j]
+		}
+		return productMap[filteredProducts[i]] > productMap[filteredProducts[j]]
+	})
+
+	return filteredProducts
 }

exercise2/problem6/problem6.go

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

exercise2/problem7/problem7.go

@@ -1,4 +1,15 @@
 package problem7
 
-func swap() {
+import (
+	"fmt"
+)
+
+func swap(x *int, y *int) {
+	*x, *y = *y, *x
+}
+
+func main() {
+	a, b := 1, 2
+	swap(&a, &b)
+	fmt.Println(a, b)
 }

exercise2/problem8/problem8.go

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

exercise2/problem9/problem9.go

@@ -1,3 +1,11 @@
 package problem9
 
-func factory() {}
+func factory(a int) func(nums ...int) []int {
+	return func(nums ...int) []int {
+		res := make([]int, len(nums))
+		for i, num := range nums {
+			res[i] = num * a
+		}
+		return res
+	}
+}