Challenge solution by skx (#57)

* Added 2

* Added 1

* Added 17

Author: skx

challenge-1/submissions/skx/solution-template.go

@@ -0,0 +1,25 @@
+package main
+
+import (
+	"fmt"
+)
+
+func main() {
+	var a, b int
+	// Read two integers from standard input
+	_, err := fmt.Scanf("%d, %d", &a, &b)
+	if err != nil {
+		fmt.Println("Error reading input:", err)
+		return
+	}
+
+	// Call the Sum function and print the result
+	result := Sum(a, b)
+	fmt.Println(result)
+}
+
+// Sum returns the sum of a and b.
+func Sum(a int, b int) int {
+
+	return a+b
+}

challenge-17/submissions/skx/solution-template.go

@@ -0,0 +1,39 @@
+package main
+
+import (
+	"fmt"
+	"strings"
+	"regexp"
+)
+
+func main() {
+	// Get input from the user
+	var input string
+	fmt.Print("Enter a string to check if it's a palindrome: ")
+	fmt.Scanln(&input)
+
+	// Call the IsPalindrome function and print the result
+	result := IsPalindrome(input)
+	if result {
+		fmt.Println("The string is a palindrome.")
+	} else {
+		fmt.Println("The string is not a palindrome.")
+	}
+}
+
+// IsPalindrome checks if a string is a palindrome.
+// A palindrome reads the same backward as forward, ignoring case, spaces, and punctuation.
+func IsPalindrome(s string) bool {
+ 
+    reg, _ := regexp.Compile("[^a-zA-Z0-9]+")
+    s = reg.ReplaceAllString(s, "")
+    s = strings.ToLower(s)
+
+	for i := 0; i < len(s) / 2; i++ {
+	    if s[i] != s[len(s) - i - 1] {
+	        return false
+	    }
+	}
+	
+	return true
+}

challenge-2/submissions/skx/solution-template.go

@@ -0,0 +1,34 @@
+package main
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"strings"
+)
+
+func main() {
+	// Read input from standard input
+	scanner := bufio.NewScanner(os.Stdin)
+	if scanner.Scan() {
+		input := scanner.Text()
+
+		// Call the ReverseString function
+		output := ReverseString(input)
+
+		// Print the result
+		fmt.Println(output)
+	}
+}
+
+// ReverseString returns the reversed string of s.
+func ReverseString(s string) string {
+runes := []rune(s)
+	builder := strings.Builder{}
+
+	for i := len(runes) - 1; i >= 0; i-- {
+		builder.WriteRune(runes[i])
+	}
+
+	return builder.String()
+}

challenge-6/submissions/skx/solution-template.go

@@ -0,0 +1,41 @@
+// Package challenge6 contains the solution for Challenge 6.
+package challenge6
+
+import (
+	// Add any necessary imports here
+	"strings"
+	
+)
+
+// CountWordFrequency takes a string containing multiple words and returns
+// a map where each key is a word and the value is the number of times that
+// word appears in the string. The comparison is case-insensitive.
+//
+// Words are defined as sequences of letters and digits.
+// All words are converted to lowercase before counting.
+// All punctuation, spaces, and other non-alphanumeric characters are ignored.
+//
+// For example:
+// Input: "The quick brown fox jumps over the lazy dog."
+// Output: map[string]int{"the": 2, "quick": 1, "brown": 1, "fox": 1, "jumps": 1, "over": 1, "lazy": 1, "dog": 1}
+func CountWordFrequency(text string) map[string]int {
+	// Your implementation here
+	m := make(map[string]int)
+	
+	text = strings.ToLower(text)
+
+    text = strings.ReplaceAll(text, "\n", " ")
+    text = strings.ReplaceAll(text, ".", " ")
+    text = strings.ReplaceAll(text, ",", " ")
+	text = strings.ReplaceAll(text, "'", "")
+	text = strings.ReplaceAll(text, "!", " ")
+	text = strings.ReplaceAll(text, "-", " ")
+	text = strings.ReplaceAll(text, "?", " ")
+	
+	for _, x := range(strings.Fields(text))  {
+        if len(x) > 0{
+            m[x] ++
+        }
+    }
+ 	return m
+}