Solution to Project Euler problem 4

package main

import "fmt"

func isPalindrome(s string) bool {
	i := 0
	j := len(s) - 1
	
	for (i <= j) {
		if s[i] != s[j] {
			return false
		}
		i = i + 1
		j = j - 1
	}
	return true
}

func main() {
	var max int
	for i := 100; i < 1000; i++ {
		for j := 100; j < 1000; j++ {
			prod := i * j
			prodStr := fmt.Sprintf("%d", prod)
			if isPalindrome(prodStr) && prod > max {
				max = prod
			}
		}
	}
	println(max)
}