[Invidam] Solve Week01 Problems (5/5) #GoLang

best-time-to-buy-and-sell-stock/invidam.go

@@ -0,0 +1,10 @@
+func maxProfit(prices []int) int {
+	purchasePrice := prices[0]
+	maxBenefit := 0
+
+	for _, price := range prices {
+		purchasePrice = min(purchasePrice, price)
+		maxBenefit = max(maxBenefit, price-purchasePrice)
+	}
+	return maxBenefit
+}

contains-duplicate/invidam.go

@@ -0,0 +1,9 @@
+func containsDuplicate(nums []int) bool {
+	appeared := make(map[int]bool)
+
+	for _, num := range nums {
+		appeared[num] = true
+	}
+
+	return len(appeared) != len(nums)
+}

two-sum/invidam.go

@@ -0,0 +1,10 @@
+func twoSum(nums []int, target int) []int {
+	need := make(map[int]int, len(nums))
+	for i, n := range nums {
+		if j, ok := need[n]; ok {
+			return []int{i, j}
+		}
+		need[target-n] = i
+	}
+	return nil
+}

valid-anagram/invidam.go

@@ -0,0 +1,23 @@
+func isAnagram(s string, t string) bool {
+	freqS := make(map[rune]int, 26)
+	freqT := make(map[rune]int, 26)
+
+	for _, ch := range s {
+		if _, ok := freqS[ch]; ok {
+			freqS[ch]++
+		} else {
+			freqS[ch] = 1
+		}
+	}
+	for _, ch := range t {
+		freqT[ch]++
+	}
+
+	for ch := 'a'; ch <= 'z'; ch++ {
+		if diff := freqS[ch] - freqT[ch]; diff != 0 {
+			return false
+		}
+	}
+
+	return true
+}

valid-palindrome/invidam.go

@@ -0,0 +1,15 @@
+func isPalindrome(s string) bool {
+	filtered := strings.Map(func(r rune) rune {
+		if !unicode.IsLetter(r) && !unicode.IsNumber(r) {
+			return -1
+		}
+		return unicode.ToLower(r)
+	}, s)
+
+	for ldx, rdx := 0, len(filtered) - 1; ldx < rdx; ldx, rdx = ldx + 1, rdx - 1 {
+		if filtered[ldx] != filtered[rdx] {
+			return false
+		}
+	}
+	return true
+}