using System;

using Fare;

using System.IO;

public class Program

{

    public static void Main()

    {

        var filter = @"(?i)^(trunk/Main/verification/test_cases)/$";

        var basePath = "";

​

        // Create a Xeger instance with the regex pattern

        var caretIndex = filter.IndexOf('^');

        var startIndex = caretIndex == -1 ? 0 : caretIndex + 1;

        var xegerFilter = filter[startIndex..];

        if (!string.IsNullOrEmpty(xegerFilter))

        {

            Xeger xeger = new Xeger(xegerFilter, new Random());

            string examplePath = xeger.Generate();

​

            // 

            var matchFilter = filter.Replace(@"\(", "(").Replace(@"\)", ")");

            Console.WriteLine($"Match filter: {matchFilter}");

            Console.WriteLine($"Example path: {examplePath}");

            basePath = GetLargestCommonSubstring(matchFilter, examplePath);

            //var path = sanitizedFilter[..diffIndex];

            var endIndex = basePath.LastIndexOf(Path.DirectorySeparatorChar) + 1;

            basePath = basePath[..endIndex];

        }

        Console.WriteLine($"\nFinal base path: {basePath}");

    }

    public static string GetLargestCommonSubstring(string str1, string str2)

    {

        int[,] dp = new int[str1.Length + 1, str2.Length + 1];

        int maxLength = 0;

        int endIndex = 0;

​

        for (int i = 1; i <= str1.Length; i++)

        {

            for (int j = 1; j <= str2.Length; j++)

            {

                if (str1[i - 1] == str2[j - 1])

                {

                    dp[i, j] = dp[i - 1, j - 1] + 1;

                    if (dp[i, j] > maxLength)

                    {

                        maxLength = dp[i, j];

                        endIndex = i;

                    }

                }

            }

        }

​

        return str1.Substring(endIndex - maxLength, maxLength);

    }

}