Tests for 5. Longest Palindromic Substring

nullskill · nullskill · commit f5d8f7247973 · 2023-06-24T14:14:29.000+03:00
diff --git a/test/leetcode_test.dart b/test/leetcode_test.dart
@@ -28,6 +28,7 @@ import 'medium/3.longest_substring_without_repeating_characters.test.dart'
     as longest_substring_without_repeating_characters;
 import 'medium/424.longest_repeating_character_replacement.test.dart' as longest_repeating_character_replacement;
 import 'medium/49.group_anagrams.test.dart' as group_anagrams;
+import 'medium/5.longest_palindromic_substring.test.dart' as longest_palindromic_substring;
 import 'medium/912.sort_an_array.test.dart' as sort_an_array;
 
 void main() {
@@ -58,5 +59,6 @@ void main() {
     element_appearing_more_than_25_percent_in_sorted_array.main();
     valid_anagram.main();
     group_anagrams.main();
+    longest_palindromic_substring.main();
   });
 }
diff --git a/test/medium/5.longest_palindromic_substring.test.dart b/test/medium/5.longest_palindromic_substring.test.dart
@@ -0,0 +1,25 @@
+import 'package:leetcode/src/medium/5.longest_palindromic_substring/main.dart';
+import 'package:test/test.dart';
+
+void main() {
+  group('longest_palindromic_substring', () {
+    final f = Solution().longestPalindrome;
+
+    test('returns empty string for empty input', () {
+      expect(f(''), equals(''));
+    });
+
+    test('returns single-character string for input with one character', () {
+      expect(f('a'), equals('a'));
+    });
+
+    test('returns longest palindromic substring for input with multiple palindromes', () {
+      expect(f('babad'), anyOf(equals('bab'), equals('aba')));
+      expect(f('cbbd'), equals('bb'));
+    });
+
+    test('returns input string for input with no palindromes', () {
+      expect(f('abc'), anyOf(equals('a'), equals('b'), equals('c')));
+    });
+  }); // group 'longest_palindromic_substring'
+}
