задача про палиндромы

5. Longest Palindromic Substring/Program.cs

@@ -1 +1,18 @@
-Console.WriteLine("Hello, World!");
+var sol = new Solution();
+
+var cases = new (string input, string expected)[]
+{
+	("babad", "bab"),
+	("cbbd", "bb"),
+	("a", "a"),
+	("ac", "a"),
+	("forgeeksskeegfor", "geeksskeeg"),
+	("abba", "abba"),
+	("racecar", "racecar")
+};
+
+foreach (var (input, expected) in cases)
+{
+	var actual = sol.LongestPalindrome(input);
+	Console.WriteLine($"{input} -> {actual} (expected: {expected})");
+}