Tests for 131. Palindrome Partitioning

nullskill · nullskill · commit a7091aaca4e8 · 2023-08-04T17:40:19.000+03:00
diff --git a/test/leetcode_test.dart b/test/leetcode_test.dart
@@ -35,6 +35,8 @@ import 'medium/560.subarray_sum_equals_k.test.dart' as subarray_sum_equals_k;
 import 'medium/647.palindromic_substrings.test.dart' as palindromic_substrings;
 import 'medium/8.string_to_integer_atoi.test.dart' as string_to_integer_atoi;
 import 'medium/912.sort_an_array.test.dart' as sort_an_array;
+import 'medium/131.palindrome_partitioning.test.dart' as palindrome_partitioning;
+
 
 void main() {
   group('Solution', () {
@@ -70,5 +72,6 @@ void main() {
     string_to_integer_atoi.main();
     subarray_sum_equals_k.main();
     generate_parentheses.main();
+    palindrome_partitioning.main();
   });
 }
diff --git a/test/medium/131.palindrome_partitioning.test.dart b/test/medium/131.palindrome_partitioning.test.dart
@@ -0,0 +1,36 @@
+import 'package:leetcode/src/medium/131.palindrome_partitioning/main.dart';
+import 'package:test/test.dart';
+
+void main() {
+  group('palindrome_partitioning', () {
+    final f = Solution().partition;
+
+    test('returns single-element list for single-character string', () {
+      expect(
+          f('a'),
+          equals([
+            ['a']
+          ]));
+    });
+
+    test('returns correct partitions for palindrome string', () {
+      expect(
+          f('racecar'),
+          equals([
+            ['racecar'],
+            ['r', 'aceca', 'r'],
+            ['r', 'a', 'cec', 'a', 'r'],
+            ['r', 'a', 'c', 'e', 'c', 'a', 'r'],
+          ]));
+    });
+
+    test('returns correct partitions for non-palindrome string', () {
+      expect(
+          f('aab'),
+          equals([
+            ['aa', 'b'],
+            ['a', 'a', 'b']
+          ]));
+    });
+  }); // group 'palindrome_partitioning'
+}
