Tests for 647. Palindromic Substrings

nullskill · nullskill · commit 9869afc16acd · 2023-06-25T14:02:57.000+03:00
diff --git a/lib/src/medium/647.palindromic_substrings/main.dart b/lib/src/medium/647.palindromic_substrings/main.dart
@@ -17,14 +17,17 @@ class Solution {
   int countPalindromes(String s, int left, int right) {
     int count = 0;
     while (left >= 0 && right < s.length && s[left] == s[right]) {
+      // print(s.substring(left, right + 1));
+
       count++;
       left--;
       right++;
     }
+
     return count;
   }
 }
 
 void main(List<String> args) {
-  print(Solution().countSubstrings('aaa'));
+  print(Solution().countSubstrings('racecar'));
 }
diff --git a/test/leetcode_test.dart b/test/leetcode_test.dart
@@ -29,6 +29,7 @@ import 'medium/3.longest_substring_without_repeating_characters.test.dart'
 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/647.palindromic_substrings.test.dart' as palindromic_substrings;
 import 'medium/912.sort_an_array.test.dart' as sort_an_array;
 
 void main() {
@@ -60,5 +61,6 @@ void main() {
     valid_anagram.main();
     group_anagrams.main();
     longest_palindromic_substring.main();
+    palindromic_substrings.main();
   });
 }
diff --git a/test/medium/647.palindromic_substrings.test.dart b/test/medium/647.palindromic_substrings.test.dart
@@ -0,0 +1,26 @@
+import 'package:leetcode/src/medium/647.palindromic_substrings/main.dart';
+import 'package:test/test.dart';
+
+void main() {
+  group('sort_an_array', () {
+    final f = Solution().countSubstrings;
+
+    test('returns 0 for empty input', () {
+      expect(f(''), equals(0));
+    });
+
+    test('returns correct count for single-character input', () {
+      expect(f('a'), equals(1));
+    });
+
+    test('returns correct count for input with single-character palindromic substrings', () {
+      expect(f('abc'), equals(3));
+    });
+
+    test('returns correct count for input with palindromes', () {
+      expect(f('aba'), equals(4));
+      expect(f('abba'), equals(6));
+      expect(f('racecar'), equals(10));
+    });
+  }); // group 'sort_an_array'
+}

Original file line number	Diff line number	Diff line change
`@@ -17,14 +17,17 @@ class Solution {`
`17`	`17`	`int countPalindromes(String s, int left, int right) {`
`18`	`18`	`int count = 0;`
`19`	`19`	`while (left >= 0 && right < s.length && s[left] == s[right]) {`
	`20`	`+ // print(s.substring(left, right + 1));`
	`21`	`+`
`20`	`22`	`count++;`
`21`	`23`	`left--;`
`22`	`24`	`right++;`
`23`	`25`	`}`
	`26`	`+`
`24`	`27`	`return count;`
`25`	`28`	`}`
`26`	`29`	`}`
`27`	`30`
`28`	`31`	`void main(List<String> args) {`
`29`		`- print(Solution().countSubstrings('aaa'));`
	`32`	`+ print(Solution().countSubstrings('racecar'));`
`30`	`33`	`}`