Longest Palindromic Substring in Go

Published on 28 April 2022 (Updated: 25 September 2022)

Longest Palindromic Substring in Go

Welcome to the Longest Palindromic Substring in Go page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

package main

import (
	"fmt"
	"os"
	"strings"
)

const errorMessage = "Usage: please provide a string that contains at least one palindrome"

func reverse(s string) string {
	result := ""
	for _, v := range s {
		result = string(v) + result
	}
	return result
}

func longestPalSubstr(str string) string {
	result := ""

	if len(str) < 2 || str == "" {
		return errorMessage
	}

	for i := 1; i < len(str); i++ {
		for j := 0; j < len(str)-i; j++ {
			possiblePal := strings.ToLower(str[j : j+i+1])

			if possiblePal == reverse(possiblePal) && len(possiblePal) > len(result) {
				result = possiblePal
			}

		}
	}

	if len(result) == 0 {
		result = errorMessage
	}
	return result
}

func printSubStr(str string, low, high int) string {
	s := ""
	for i := low; i <= high; i++ {
		s = s + string(str[i])
	}

	return s
}

func main() {
	if len(os.Args) < 2 {
		fmt.Println(errorMessage)
	} else {
		fmt.Println(longestPalSubstr(os.Args[1]))
	}
}

Longest Palindromic Substring in Go was written by:

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.