Madina Bimakanova exercise 7

exercise1/problem1/main.go

@@ -1,3 +1,5 @@
 package main
 
-func addUp() {}
+func addUp(n int) int {
+	return n * (n + 1) / 2
+}

exercise1/problem10/main.go

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

exercise1/problem2/main.go

@@ -1,3 +1,17 @@
 package main
 
-func binary() {}
+import "strconv"
+
+func binary(decNumber int) string {
+	if decNumber == 0 {
+		return "0"
+	}
+	binaryNumber := ""
+	for decNumber > 0 {
+		binaryNumber = strconv.Itoa(decNumber%2) + binaryNumber
+		decNumber = decNumber / 2
+	}
+
+	return binaryNumber
+
+}

exercise1/problem3/main.go

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

exercise1/problem4/main.go

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

exercise1/problem5/main.go

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

exercise1/problem6/main.go

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

exercise1/problem7/main.go

@@ -1,3 +1,13 @@
 package main
 
-func highestDigit() {}
+func highestDigit(number int) int {
+	maxDigit := 0
+	for number != 0 {
+		digit := number % 10
+		if digit > maxDigit {
+			maxDigit = digit
+		}
+		number = number / 10
+	}
+	return maxDigit
+}

exercise1/problem8/main.go

@@ -1,3 +1,14 @@
 package main
 
-func countVowels() {}
+func countVowels(word string) int {
+	vowels := []string{"a", "e", "i", "o", "u"}
+	count := 0
+	for _, i := range word {
+		for _, j := range vowels {
+			if string(i) == j {
+				count++
+			}
+		}
+	}
+	return count
+}

exercise1/problem9/main.go

@@ -1,7 +1,13 @@
 package main
 
-func bitwiseAND() {}
+func bitwiseAND(n1, n2 int) int {
+	return n1 & n2
+}
 
-func bitwiseOR() {}
+func bitwiseOR(n1, n2 int) int {
+	return n1 | n2
+}
 
-func bitwiseXOR() {}
+func bitwiseXOR(n1, n2 int) int {
+	return n1 ^ n2
+}

exercise2/problem1/problem1.go

@@ -1,4 +1,17 @@
 package problem1
 
-func isChangeEnough() {
+func isChangeEnough(change [4]int, amount float32) bool {
+	var (
+		is_pay   bool = false
+		summa    int  = 0
+		nominals      = [4]int{25, 10, 5, 1}
+	)
+	for i, v := range change {
+		summa += nominals[i] * v
+	}
+	amount_int := int(amount * 100)
+	if summa >= amount_int {
+		is_pay = true
+	}
+	return is_pay
 }

exercise2/problem10/problem10.go

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

exercise2/problem11/problem11.go

@@ -1,3 +1,13 @@
 package problem11
 
-func removeDups() {}
+func removeDups[T comparable](slc []T) []T {
+	new_slc := make([]T, 0, len(slc))
+	proverka_slc := make(map[any]struct{})
+	for _, v := range slc {
+		if _, ok := proverka_slc[v]; !ok {
+			proverka_slc[v] = struct{}{}
+			new_slc = append(new_slc, v)
+		}
+	}
+	return new_slc
+}

exercise2/problem12/problem12.go

@@ -1,3 +1,33 @@
 package problem11
 
-func keysAndValues() {}
+import "fmt"
+
+func keysAndValues[K comparable, V any](map_keysAndValues map[K]V) ([]K, []V) {
+	mas_keys := make([]K, 0, len(map_keysAndValues))
+	mas_values := make([]V, 0, len(map_keysAndValues))
+
+	for k, v := range map_keysAndValues {
+		mas_keys = append(mas_keys, k)
+		mas_values = append(mas_values, v)
+	}
+
+	sort_keys(mas_keys)
+
+	sortedValues := make([]V, len(mas_keys))
+	for i, k := range mas_keys {
+		sortedValues[i] = map_keysAndValues[k]
+	}
+
+	return mas_keys, sortedValues
+}
+
+func sort_keys[K comparable](keys []K) {
+	n := len(keys)
+	for i := 0; i < n; i++ {
+		for j := 0; j < n-i-1; j++ {
+			if fmt.Sprintf("%v", keys[j]) > fmt.Sprintf("%v", keys[j+1]) {
+				keys[j], keys[j+1] = keys[j+1], keys[j]
+			}
+		}
+	}
+}

exercise2/problem2/problem2.go

@@ -1,4 +1,18 @@
 package problem2
 
-func capitalize() {
+func capitalize(names []string) []string {
+	var capitalizeNames []string
+	for _, name := range names {
+		var capitalizeName string
+		for i, char := range name {
+			if i == 0 && (char >= 'a' && char <= 'z') {
+				char -= 'a' - 'A'
+			} else if i != 0 && (char >= 'A' && char <= 'Z') {
+				char += 'a' - 'A'
+			}
+			capitalizeName += string(char)
+		}
+		capitalizeNames = append(capitalizeNames, capitalizeName)
+	}
+	return capitalizeNames
 }

exercise2/problem3/problem3.go

@@ -9,5 +9,21 @@ const (
 	lr dir = "lr"
 )
 
-func diagonalize() {
+func diagonalize(number int, diagonal dir) [][]int {
+	matrix := make([][]int, number)
+	for i := 0; i < number; i++ {
+		matrix[i] = make([]int, number)
+		for j := 0; j < number; j++ {
+			if diagonal == ul {
+				matrix[i][j] = i + j
+			} else if diagonal == ur {
+				matrix[i][j] = number + i - j - 1
+			} else if diagonal == ll {
+				matrix[i][j] = number - i + j - 1
+			} else {
+				matrix[i][j] = 2*number - i - j - 2
+			}
+		}
+	}
+	return matrix
 }

exercise2/problem4/problem4.go

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

exercise2/problem5/problem5.go

@@ -1,4 +1,24 @@
 package problem5
 
-func products() {
+func products(pricesProducts map[string]int, minPrice int) []string {
+	var result []string
+	for i, v := range pricesProducts {
+		if v > minPrice {
+			result = append(result, i)
+		}
+	}
+	sortProducts(result, pricesProducts)
+	return result
+}
+func sortProducts(products []string, prices map[string]int) []string {
+	n := len(products)
+	for i := 0; i < n; i++ {
+		for j := 0; j < n-i-1; j++ {
+			if prices[products[j]] < prices[products[j+1]] ||
+				(prices[products[j]] == prices[products[j+1]] && products[j] > products[j+1]) {
+				products[j], products[j+1] = products[j+1], products[j]
+			}
+		}
+	}
+	return products
 }

exercise2/problem6/problem6.go

@@ -1,4 +1,14 @@
 package problem6
 
-func sumOfTwo() {
+func sumOfTwo(slc1 []int, slc2 []int, number int) bool {
+	var is_sum bool
+	for _, v1 := range slc1 {
+		for _, v2 := range slc2 {
+			if (v1 + v2) == number {
+				is_sum = true
+				break
+			}
+		}
+	}
+	return is_sum
 }

exercise2/problem7/problem7.go

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

exercise2/problem8/problem8.go

@@ -1,16 +1,15 @@
 package problem8
 
 func simplify(list []string) map[string]int {
-	var indMap map[string]int
+	indMap := make(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,10 @@
 package problem9
 
-func factory() {}
+func factory(number int) func(...int) []int {
+	return func(mas ...int) []int {
+		for i := 0; i < len(mas); i++ {
+			mas[i] = mas[i] * number
+		}
+		return mas
+	}
+}