Bump eslint-plugin-jest from 28.12.0 to 28.13.0

package.json

@@ -35,7 +35,7 @@
     "eslint-config-airbnb-base": "15.0.0",
     "eslint-config-prettier": "10.1.5",
     "eslint-plugin-import": "2.31.0",
-    "eslint-plugin-jest": "28.12.0",
+    "eslint-plugin-jest": "28.13.0",
     "eslint-plugin-prettier": "5.4.1",
     "eslint-watch": "8.0.0",
     "globals": "^16.0.0",

src/hackerrank/interview_preparation_kit/arrays/2d_array.test.js

@@ -6,7 +6,7 @@ import TEST_CASES from './2d_array.testcases_test.json';
 
 describe('arrays: 2d Array hourglassSum', () => {
   it('hourglassSum Test Cases', () => {
-    expect.assertions(3);
+    expect.assertions(4);
 
     TEST_CASES.forEach((test) => {
       const answer = hourglassSum(test.input);
@@ -17,5 +17,7 @@ describe('arrays: 2d Array hourglassSum', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 });

src/hackerrank/interview_preparation_kit/arrays/cruch_bruteforce.test.js

@@ -7,7 +7,7 @@ import { arrayManipulation } from './cruch_bruteforce.js';
 
 describe('arrays: crush (bruteforce) small cases', () => {
   it('arrayManipulation Test Cases', () => {
-    expect.assertions(3);
+    expect.assertions(4);
 
     TEST_CASES.forEach((test) => {
       const answer = arrayManipulation(test.n, test.queries);
@@ -18,5 +18,7 @@ describe('arrays: crush (bruteforce) small cases', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 });

src/hackerrank/interview_preparation_kit/arrays/cruch_optimized.test.js

@@ -7,7 +7,7 @@ import { arrayManipulation } from './cruch_optimized.js';
 
 describe('arrays: crush (optimized)', () => {
   it('arrayManipulation Test Cases', () => {
-    expect.assertions(3);
+    expect.assertions(4);
 
     TEST_CASES.forEach((test) => {
       const answer = arrayManipulation(test.n, test.queries);
@@ -18,5 +18,7 @@ describe('arrays: crush (optimized)', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 });

src/hackerrank/interview_preparation_kit/arrays/ctci_array_left_rotation.test.js

@@ -7,7 +7,7 @@ import ROT_LEFT_TEST_CASES from './ctci_array_left_rotation.testcases.json';
 
 describe('ctci_array_left_rotation', () => {
   it('rotLeft Test cases', () => {
-    expect.assertions(8);
+    expect.assertions(9);
 
     ROT_LEFT_TEST_CASES.forEach((test) => {
       const answer = rotLeft(test.input, test.d_rotations);
@@ -16,5 +16,7 @@ describe('ctci_array_left_rotation', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(ROT_LEFT_TEST_CASES).toHaveLength(8);
   });
 });

src/hackerrank/interview_preparation_kit/arrays/minimum_swaps_2.test.js

@@ -7,7 +7,7 @@ import TEST_CASES from './minimum_swaps_2.testcases.json';
 
 describe('minimum swaps 2', () => {
   it('minimumSwaps', () => {
-    expect.assertions(3);
+    expect.assertions(4);
 
     TEST_CASES.forEach((test) => {
       const answer = minimumSwaps(test.input);
@@ -16,5 +16,7 @@ describe('minimum swaps 2', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 });

src/hackerrank/interview_preparation_kit/arrays/new_year_chaos.test.js

@@ -7,7 +7,7 @@ import TEST_CASES from './new_year_chaos.testcases.json';
 
 describe('new_year_chaos', () => {
   it('minimumBribes Test Cases', () => {
-    expect.assertions(5);
+    expect.assertions(6);
 
     TEST_CASES.forEach((test) => {
       const answer = minimumBribesText(test.input);
@@ -19,5 +19,7 @@ describe('new_year_chaos', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(5);
   });
 });

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1_bruteforce.test.js

@@ -7,7 +7,7 @@ import SMALL_TEST_CASES from './count_triplets_1.small.testcases.json';
 
 describe('count_triplets_1', () => {
   it('countTriplets test cases', () => {
-    expect.assertions(4);
+    expect.assertions(5);
 
     SMALL_TEST_CASES.forEach((test) => {
       const answer = countTriplets(test.input, test.r);
@@ -18,5 +18,7 @@ describe('count_triplets_1', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(SMALL_TEST_CASES).toHaveLength(4);
   });
 });

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1_optimized.test.js

@@ -7,7 +7,7 @@ import BIG_TEST_CASES from './count_triplets_1.big.testcases.json';
 
 describe('count_triplets_1 (optimized)', () => {
   it('countTriplets small test cases', () => {
-    expect.assertions(4);
+    expect.assertions(5);
 
     SMALL_TEST_CASES.forEach((test) => {
       const answer = countTriplets(test.input, test.r);
@@ -18,10 +18,12 @@ describe('count_triplets_1 (optimized)', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(SMALL_TEST_CASES).toHaveLength(4);
   });
 
   it('countTriplets big test cases', () => {
-    expect.assertions(1);
+    expect.assertions(2);
 
     BIG_TEST_CASES.forEach((test) => {
       const answer = countTriplets(test.input, test.r);
@@ -32,5 +34,7 @@ describe('count_triplets_1 (optimized)', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(BIG_TEST_CASES).toHaveLength(1);
   });
 });

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.test.js

@@ -6,7 +6,7 @@ import TEST_CASES from './ctci-ransom-note.testcases.json';
 
 describe('ctci_ransom_note', () => {
   it('checkMagazine test cases', () => {
-    expect.assertions(3);
+    expect.assertions(4);
 
     TEST_CASES.forEach((value) => {
       const answer = checkMagazineText(value.magazine, value.note);
@@ -18,5 +18,7 @@ describe('ctci_ransom_note', () => {
 
       expect(answer).toStrictEqual(value.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 });

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/frequency_queries_bruteforce.test.js

@@ -6,7 +6,7 @@ import SMALL_TEST_CASES from './frequency_queries_testcases.json';
 
 describe('frequency_queries', () => {
   it('freqQuery test cases', () => {
-    expect.assertions(4);
+    expect.assertions(5);
 
     SMALL_TEST_CASES.forEach((value) => {
       const answer = freqQuery(value.input);
@@ -15,6 +15,8 @@ describe('frequency_queries', () => {
 
       expect(answer).toStrictEqual(value.expected);
     });
+
+    expect(SMALL_TEST_CASES).toHaveLength(4);
   });
 
   it('freqQuery border case', () => {

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/frequency_queries_optimized.test.js

@@ -6,7 +6,7 @@ import TEST_CASES from './frequency_queries_testcases.json';
 
 describe('frequency_queries', () => {
   it('freqQuery test cases', () => {
-    expect.assertions(4);
+    expect.assertions(5);
 
     TEST_CASES.forEach((value) => {
       const answer = freqQuery(value.input);
@@ -15,6 +15,8 @@ describe('frequency_queries', () => {
 
       expect(answer).toStrictEqual(value.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(4);
   });
 
   it('freqQuery border case', () => {

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.test.js

@@ -6,7 +6,9 @@ import TEST_CASES from './sherlock_and_anagrams.testcases.json';
 
 describe('sherlock_and_anagrams', () => {
   it('sherlockAndAnagrams test cases', () => {
-    expect.assertions(15);
+    expect.assertions(17);
+
+    let totalTestsCount = 0;
 
     TEST_CASES.forEach((testSet) => {
       testSet.tests.forEach((test) => {
@@ -17,7 +19,12 @@ describe('sherlock_and_anagrams', () => {
         );
 
         expect(answer).toStrictEqual(test.expected);
+
+        totalTestsCount += 1;
       });
     });
+
+    expect(TEST_CASES).toHaveLength(4);
+    expect(totalTestsCount).toBe(15);
   });
 });

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/two_strings.test.js

@@ -6,7 +6,9 @@ import TEST_CASES from './two_strings.testcases.json';
 
 describe('two_strings', () => {
   it('twoStrings test cases', () => {
-    expect.assertions(8);
+    expect.assertions(10);
+
+    let totalTestsCount = 0;
 
     TEST_CASES.forEach((testCase) => {
       testCase.tests.forEach((test) => {
@@ -17,7 +19,12 @@ describe('two_strings', () => {
         );
 
         expect(answer).toStrictEqual(test.expected);
+
+        totalTestsCount += 1;
       });
     });
+
+    expect(TEST_CASES).toHaveLength(3);
+    expect(totalTestsCount).toBe(8);
   });
 });

src/hackerrank/interview_preparation_kit/dynamic_programming/max_array_sum.test.js

@@ -12,7 +12,7 @@ const DECIMAL_RADIX = 10;
 
 describe('max_array_sum', () => {
   it('maxSubsetSum test cases', () => {
-    expect.assertions(4);
+    expect.assertions(5);
 
     ALL_TEST_CASES.forEach((test) => {
       const answer = maxSubsetSum(test.input).toString(DECIMAL_RADIX);
@@ -21,6 +21,8 @@ describe('max_array_sum', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 
   it('maxSubsetSum edge case zero', () => {

src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.test.js

@@ -7,7 +7,7 @@ import TEST_CASES from './angry_children.testcases.json';
 
 describe('angry_children', () => {
   it('maxMin test cases', () => {
-    expect.assertions(4);
+    expect.assertions(5);
 
     TEST_CASES.forEach((test) => {
       const answer = maxMin(test.k, test.arr);
@@ -16,5 +16,7 @@ describe('angry_children', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(4);
   });
 });

src/hackerrank/interview_preparation_kit/greedy_algorithms/greedy_florist.test.js

@@ -7,7 +7,7 @@ import TEST_CASES from './greedy_florist.testcases.json';
 
 describe('greedy_florist', () => {
   it('getMinimumCost test cases', () => {
-    expect.assertions(3);
+    expect.assertions(4);
 
     TEST_CASES.forEach((test) => {
       const answer = getMinimumCost(test.k, test.contests);
@@ -18,5 +18,7 @@ describe('greedy_florist', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 });

src/hackerrank/interview_preparation_kit/greedy_algorithms/luck-balance.test.js

@@ -7,7 +7,7 @@ import TEST_CASES from './luck-balance.testcases.json';
 
 describe('luck-balance', () => {
   it('luckBalance test cases', () => {
-    expect.assertions(3);
+    expect.assertions(4);
 
     TEST_CASES.forEach((test) => {
       const answer = luckBalance(test.k, test.contests);
@@ -18,5 +18,7 @@ describe('luck-balance', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 });

src/hackerrank/interview_preparation_kit/greedy_algorithms/minimum_absolute_difference_in_an_array.test.js

@@ -7,7 +7,7 @@ import TEST_CASES from './minimum_absolute_difference_in_an_array.testcases.json
 
 describe('minimum_absolute_difference_in_an_array', () => {
   it('minimumAbsoluteDifference test cases', () => {
-    expect.assertions(3);
+    expect.assertions(4);
 
     TEST_CASES.forEach((test) => {
       const answer = minimumAbsoluteDifference(test.input);
@@ -18,5 +18,7 @@ describe('minimum_absolute_difference_in_an_array', () => {
 
       expect(answer).toStrictEqual(test.expected);
     });
+
+    expect(TEST_CASES).toHaveLength(3);
   });
 });