Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Hacker Rank] Interview Preparation Kit: Dictionaries and Hashmaps: H… #372

Merged
merged 1 commit into from
Jul 3, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -0,0 +1,102 @@
# [Hash Tables: Ransom Notes](https://www.hackerrank.com/challenges/ctci-ransom-note)

- Difficulty: `#easy`
- Category: `#ProblemSolvingIntermediate`

Harold is a kidnapper who wrote a ransom note, but now he is worried it will be
traced back to him through his handwriting. He found a magazine and wants to
know if he can cut out whole words from it and use them to create an untraceable
replica of his ransom note.
The words in his note are case-sensitive and he must use only whole words
available in the magazine.
He cannot use substrings or concatenation to create the words he needs.

Given the words in the magazine and the words in the ransom note,
print `Yes` if he can replicate his ransom note exactly using whole words
from the magazine; otherwise, print `No`.

## Example

`magazine` = "attack at dawn" `note` = "Attack at dawn"

The magazine has all the right words, but there is a case mismatch.
The answer is `No`.

## Function Description

Complete the checkMagazine function in the editor below.
It must print `Yes` if the note can be formed using the magazine, or .

checkMagazine has the following parameters:

- `string magazine[m]`: the words in the magazine
- `string note[n]`: the words in the ransom note

## Prints

- string: either or , no return value is expected

## Input Format

The first line contains two space-separated integers, `m` and `n`,
the numbers of words in the and the , respectively.

The second line contains `m` space-separated strings, each `magazine[i]`.

The third line contains `n` space-separated strings, each `node[i]`.

## Constraints

- $ 1 \leq m, n \leq 30000 $
- $ 1 \leq $ length of `magazine[i]` and `note[i]` $ \leq 5 $
- Each word consists of English alphabetic letters (i.e., `a` to `z` and `A` to `Z`).

## Sample Input 0

```text
6 4
give me one grand today night
give one grand today
```

## Sample Output 0

```text
Yes
```

## Sample Input 1

```text
6 5
two times three is not four
two times two is four
```

## Sample Output 1

```text
No
```

## Explanation 1

'two' only occurs once in the magazine.

## Sample Input 2

```text
7 4
ive got a lovely bunch of coconuts
ive got some coconuts
```

## Sample Output 2

```text
No
```

## Explanation 2

Harold's magazine is missing the word `some`.
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
import { describe, expect, it } from '@jest/globals';
import { logger as console } from '../../../logger';

import { checkMagazine } from './ctci-ransom-note';

const TEST_CASES = [
{
title: 'Sample Test Case 0',
magazine: ['give', 'me', 'one', 'grand', 'today', 'night'],
note: ['give', 'one', 'grand', 'today'],
expected: 'Yes'
},
{
title: 'Sample Test Case 1',
magazine: ['two', 'times', 'three', 'is', 'not', 'four'],
note: ['two', 'times', 'two', 'is', 'four'],
expected: 'No'
},
{
title: 'Sample Test',
magazine: ['two', 'two', 'times', 'three', 'is', 'not', 'four'],
note: ['two', 'times', 'two', 'is', 'four'],
expected: 'Yes'
}
];
describe('ctci_ransom_note', () => {
it('checkMagazine test cases', () => {
expect.assertions(3);

TEST_CASES.forEach((value) => {
const answer = checkMagazine(value.magazine, value.note);

console.debug(
`checkMagazine(${value.magazine}, ${value.note}) solution found: ${answer}`
);

expect(answer).toStrictEqual(value.expected);
});
});
});
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
/**
* @link Problem definition [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.md]]
*/

const __YES__ = 'Yes';
const __NO__ = 'No';

export function checkMagazineCompute(
magazine: string[],
note: string[]
): boolean {
const dictionary: Record<string, number> = {};

for (const word of magazine) {
if (word in dictionary) {
dictionary[word] += 1;
} else {
dictionary[word] = 1;
}
}

for (const word of note) {
if (word in dictionary && dictionary[word] > 0) {
dictionary[word] -= 1;
} else {
return false;
}
}

return true;
}

export function checkMagazine(magazine: string[], note: string[]): string {
return checkMagazineCompute(magazine, note) ? __YES__ : __NO__;
}

export default { checkMagazine };