GO Solution For UVa 10100 - Longest Match. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

A newly opened detective agency is struggling with their limited intelligence to find out a secret infor- mation passing technique among its detectives. Since they are new in this profession, they know well that their messages will easily be trapped and hence modified by other groups. They want to g


You can find the full details of the problem Longest Match at UVa Online Judge

Sample Input

This is a test.

The document provides late-breaking provides information
late breaking!yay!information.

Sample Output

 1. Length of longest match: 1
 2. Blank!
 3. Length of longest match: 3

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985