Tests for 560. Subarray Sum Equals K

nullskill · nullskill · commit aa5efa4e8cdd · 2023-07-31T23:09:42.000+03:00
diff --git a/test/leetcode_test.dart b/test/leetcode_test.dart
@@ -30,6 +30,7 @@ import 'medium/424.longest_repeating_character_replacement.test.dart' as longest
 import 'medium/49.group_anagrams.test.dart' as group_anagrams;
 import 'medium/5.longest_palindromic_substring.test.dart' as longest_palindromic_substring;
 import 'medium/516.longest_palindromic_subsequence.test.dart' as longest_palindromic_subsequence;
+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;
@@ -66,5 +67,6 @@ void main() {
     palindromic_substrings.main();
     longest_palindromic_subsequence.main();
     string_to_integer_atoi.main();
+    subarray_sum_equals_k.main();
   });
 }
diff --git a/test/medium/560.subarray_sum_equals_k.test.dart b/test/medium/560.subarray_sum_equals_k.test.dart
@@ -0,0 +1,32 @@
+import 'package:leetcode/src/medium/560.subarray_sum_equals_k/main.dart';
+import 'package:test/test.dart';
+
+void main() {
+  group('subarray_sum_equals_k', () {
+    final f = Solution().subarraySum;
+
+    test('f([1, 2, 3, 6, 4, 6], 6)', () {
+      expect(f([1, 2, 3, 6, 4, 6], 6), equals(3));
+    });
+
+    test('f([-1, -1, 1], 0)', () {
+      expect(f([-1, -1, 1], 0), equals(1));
+    });
+
+    test('f([1, 2, 5, 3, 4], 6)', () {
+      expect(f([1, 2, 5, 3, 4], 6), equals(0));
+    });
+
+    test('f([1, 1, 1], 2)', () {
+      expect(f([1, 1, 1], 2), equals(2));
+    });
+
+    test('f([1], 1)', () {
+      expect(f([1], 1), equals(1));
+    });
+
+    test('f([-1, 2, -1, -2, -3], -3)', () {
+      expect(f([-1, 2, -1, -2, -3], -3), equals(2));
+    });
+  }); // group 'subarray_sum_equals_k'
+}
