Skip to content

Commit ebfee26

Browse files
author
Gonzalo Diaz
committed
[REFACTOR] new eslint rules fixed.
1 parent babe0da commit ebfee26

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

43 files changed

+204
-61
lines changed

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ import TEST_CASES from './2d_array.testcases_test.json';
66

77
describe('arrays: 2d Array hourglassSum', () => {
88
it('hourglassSum Test Cases', () => {
9-
expect.assertions(3);
9+
expect.assertions(4);
1010

1111
TEST_CASES.forEach((test) => {
1212
const answer = hourglassSum(test.input);
@@ -17,5 +17,7 @@ describe('arrays: 2d Array hourglassSum', () => {
1717

1818
expect(answer).toStrictEqual(test.expected);
1919
});
20+
21+
expect(TEST_CASES).toHaveLength(3);
2022
});
2123
});

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ import { arrayManipulation } from './cruch_bruteforce';
77

88
describe('arrays: crush (bruteforce) small cases', () => {
99
it('arrayManipulation Test Cases', () => {
10-
expect.assertions(3);
10+
expect.assertions(4);
1111

1212
TEST_CASES.forEach((test) => {
1313
const answer = arrayManipulation(test.n, test.queries);
@@ -18,5 +18,7 @@ describe('arrays: crush (bruteforce) small cases', () => {
1818

1919
expect(answer).toStrictEqual(test.expected);
2020
});
21+
22+
expect(TEST_CASES).toHaveLength(3);
2123
});
2224
});

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ import { arrayManipulation } from './cruch_optimized';
77

88
describe('arrays: crush (optimized)', () => {
99
it('arrayManipulation Test Cases', () => {
10-
expect.assertions(3);
10+
expect.assertions(4);
1111

1212
TEST_CASES.forEach((test) => {
1313
const answer = arrayManipulation(test.n, test.queries);
@@ -18,5 +18,7 @@ describe('arrays: crush (optimized)', () => {
1818

1919
expect(answer).toStrictEqual(test.expected);
2020
});
21+
22+
expect(TEST_CASES).toHaveLength(3);
2123
});
2224
});

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ const TEST_CASES: RotLeftTestCase[] = ROT_LEFT_TEST_CASES as RotLeftTestCase[];
1616

1717
describe('ctci_array_left_rotation', () => {
1818
it('rotLeft Test cases', () => {
19-
expect.assertions(8);
19+
expect.assertions(9);
2020

2121
TEST_CASES.forEach((test: RotLeftTestCase) => {
2222
const answer = rotLeft(test.input, Number(test.d_rotations));
@@ -27,5 +27,7 @@ describe('ctci_array_left_rotation', () => {
2727

2828
expect(answer).toStrictEqual(test.expected);
2929
});
30+
31+
expect(TEST_CASES).toHaveLength(8);
3032
});
3133
});

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ import TEST_CASES from './minimum_swaps_2.testcases.json';
77

88
describe('minimum swaps 2', () => {
99
it('minimumSwaps', () => {
10-
expect.assertions(3);
10+
expect.assertions(4);
1111

1212
TEST_CASES.forEach((test) => {
1313
const answer = minimumSwaps(test.input);
@@ -18,5 +18,7 @@ describe('minimum swaps 2', () => {
1818

1919
expect(answer).toStrictEqual(test.expected);
2020
});
21+
22+
expect(TEST_CASES).toHaveLength(3);
2123
});
2224
});

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ import TEST_CASES from './new_year_chaos.testcases.json';
77

88
describe('new_year_chaos', () => {
99
it('minimumBribes Test Cases', () => {
10-
expect.assertions(5);
10+
expect.assertions(6);
1111

1212
TEST_CASES.forEach((value) => {
1313
const answer = minimumBribesText(value.input);
@@ -19,5 +19,7 @@ describe('new_year_chaos', () => {
1919

2020
expect(answer).toStrictEqual(value.expected);
2121
});
22+
23+
expect(TEST_CASES).toHaveLength(5);
2224
});
2325
});

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ import SMALL_TEST_CASES from './count_triplets_1.small.testcases.json';
77

88
describe('count_triplets_1', () => {
99
it('countTriplets test cases', () => {
10-
expect.assertions(4);
10+
expect.assertions(5);
1111

1212
SMALL_TEST_CASES.forEach((test) => {
1313
const answer = CountTriplets.countTriplets(test.input, test.r);
@@ -18,5 +18,7 @@ describe('count_triplets_1', () => {
1818

1919
expect(answer).toStrictEqual(test.expected);
2020
});
21+
22+
expect(SMALL_TEST_CASES).toHaveLength(4);
2123
});
2224
});

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

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ import BIG_TEST_CASES from './count_triplets_1.big.testcases.json';
88

99
describe('count_triplets_1 (optimized)', () => {
1010
it('countTriplets small test cases', () => {
11-
expect.assertions(4);
11+
expect.assertions(5);
1212

1313
SMALL_TEST_CASES.forEach((test) => {
1414
const answer = CountTriplets.countTriplets(test.input, test.r);
@@ -19,10 +19,12 @@ describe('count_triplets_1 (optimized)', () => {
1919

2020
expect(answer).toStrictEqual(test.expected);
2121
});
22+
23+
expect(SMALL_TEST_CASES).toHaveLength(4);
2224
});
2325

2426
it('countTriplets big test cases', () => {
25-
expect.assertions(1);
27+
expect.assertions(2);
2628

2729
BIG_TEST_CASES.forEach((test) => {
2830
const answer = CountTriplets.countTriplets(test.input, test.r);
@@ -33,5 +35,7 @@ describe('count_triplets_1 (optimized)', () => {
3335

3436
expect(answer).toStrictEqual(test.expected);
3537
});
38+
39+
expect(BIG_TEST_CASES).toHaveLength(1);
3640
});
3741
});

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ import TEST_CASES from './ctci-ransom-note.testcases.json';
77

88
describe('ctci_ransom_note', () => {
99
it('checkMagazine test cases', () => {
10-
expect.assertions(3);
10+
expect.assertions(4);
1111

1212
TEST_CASES.forEach((value) => {
1313
const answer = checkMagazine(value.magazine, value.note);
@@ -18,5 +18,7 @@ describe('ctci_ransom_note', () => {
1818

1919
expect(answer).toStrictEqual(value.expected);
2020
});
21+
22+
expect(TEST_CASES).toHaveLength(3);
2123
});
2224
});

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ import SMALL_TEST_CASES from './frequency_queries_testcases.json';
66

77
describe('frequency_queries_bruteforce', () => {
88
it('freqQuery test cases', () => {
9-
expect.assertions(4);
9+
expect.assertions(5);
1010

1111
SMALL_TEST_CASES.forEach((value) => {
1212
const answer = freqQuery(value.input);
@@ -17,6 +17,8 @@ describe('frequency_queries_bruteforce', () => {
1717

1818
expect(answer).toStrictEqual(value.expected);
1919
});
20+
21+
expect(SMALL_TEST_CASES).toHaveLength(4);
2022
});
2123

2224
it('freqQuery border case', () => {

0 commit comments

Comments
 (0)