Go Project Euler exercise

main.go

// Find a problem at projecteuler.net then create the solution. Add a
// comment beneath your solution that includes a description of the
// problem. Upload your solution to github. Tweet me a link to your
// solution.
//
// https://projecteuler.net/problem=4
// A palindromic number reads the same both ways. The largest palindrome
// made from the product of two 2-digit numbers is 9009 = 91 × 99.
//
// Find the largest palindrome made from the product of two 3-digit
// numbers.

package main

import (
	"fmt"
	"strconv"
)

func main() {
	num1, num2, result := findPalindrome(100, 999)
	fmt.Printf("%v * %v = %v, which is the largest palindrome!", num1, num2, result)
}

func findPalindrome(min, max int) (num1, num2, result int) {
	var largestNumber1 int
	var largestNumber2 int
	var largestResult int

	for num1 := min; num1 <= max; num1++ {
		for num2 := min; num2 <= max; num2++ {
			result := num1 * num2
			if isPalindrome(result) == true && result > largestResult {
				largestResult = result
				largestNumber1 = num1
				largestNumber2 = num2
			}
		}
	}
	return largestNumber1, largestNumber2, largestResult
}

func isPalindrome(num int) bool {
	s := strconv.Itoa(num)

	for i := 0; i < len(s)/2; i++ {
		first := s[0+i]
		last := s[len(s)-(1+i)]
		if first != last {
			return false
		}
	}
	return true
}