https://github.com/teddyoweh/hackerrank
My Solutions to the Hackerrank Problems
https://github.com/teddyoweh/hackerrank
Last synced: 6 months ago
JSON representation
My Solutions to the Hackerrank Problems
- Host: GitHub
- URL: https://github.com/teddyoweh/hackerrank
- Owner: teddyoweh
- Created: 2022-06-01T05:09:26.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-06-15T16:05:28.000Z (over 3 years ago)
- Last Synced: 2025-03-24T00:26:40.404Z (6 months ago)
- Language: Python
- Size: 6.84 KB
- Stars: 7
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Hackerrank
My Solutions to the Hackerrank Problems
## Question 1 | Unexpected Demand
```
A widget manufacturer is facing unexpectedly high demand for its new product.
They would like to satisfy as many customers as possible.
Given a number of widgets available and a list of customer orders,
what is the maximum number of orders the manufacturer can fulfill in full?
Function Description
Complete the function filledOrders in the editor below.
The function must return a single integer denoting the maximum possible number of fulfilled orders.
filledOrders has the following parameter(s):
order : an array of integers listing the orders
k : an integer denoting widgets available for shipment
Constraints
1 ≤ n ≤ 2 x 105
1 ≤ order[i] ≤ 109
1 ≤ k ≤ 109
Input Format For Custom Testing
The first line contains an integer, n, denoting the number of orders.
Each line i of the n subsequent lines contains an integer order[i].
Next line contains a single integer k denoting the widgets available.
Sample Case 0
Sample Input For Custom Testing
2
10
30
40
Sample Output
2
Explanation
order = [10,30] with 40 widgets available. Both orders can be fulfilled.
Sample Case 1
Sample Input For Custom Testing
3
5
4
6
3
Sample Output
0
Explanation
order = [5,4,6] with 3 widgets available
None of the orders can be fulfilled.
```
```py
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER_ARRAY order
# 2. INTEGER k
#
```
## Question 2 | String Anagram
```
An anagram of a string is another string with the same characters in the same frequency,
in any order. For example 'abc', 'bca', 'acb', 'bac', 'cba', 'cab' are all anagrams of the string 'abc'.
Given two arrays of strings, for every string in one list,
determine how many anagrams of it are in the other list.
Write a function that receives dictionary and query,
two string arrays. It should return an array of integers
where each element i contains the number of anagrams of query[i] that exist in dictionary.
Example
dictionary = ['hack', 'a', 'rank', 'khac', 'ackh', 'kran', 'rankhacker', 'a', 'ab', 'ba', 'stairs', 'raits']
query = ["a", "nark", "bs", "hack", "stair"]
query[0] = 'a' has 2 anagrams in dictionary: 'a' and 'a'.
query[1] = 'nark' has 2 anagrams in dictionary: 'rank' and 'kran'.
query[2] = 'bs' has 0 anagrams in dictionary.
query[3] = 'hack' has 3 anagrams in dictionary: 'hack', 'khac' and 'ackh'.
query[4] = 'stair' has 1 anagram in dictionary: 'raits'. While the characters are the same in 'stairs', the frequency of 's' differs, so it is not an anagram.
The final answer is [2, 2, 0, 3, 1].
Function Description
Complete the function stringAnagram in the editor below.
stringAnagram has the following parameters:
string dictionary[n]: an array of strings to search in
string query[q]: an array of strings to search for
Returns
int[q]: an array of integers where the ith value is the answer to query[i]
Constraints
1 ≤ length(dictionary), length(query) ≤ 105
1 ≤ length(dictionary[i]) ≤ 15
1 ≤ length(query[i]) ≤ 15
Every string consists of lowercase English letters.
Input Format For Custom Testing
The first line of input contains an integer, n, the number of strings in dictionary[].
Each line i of the n subsequent lines (where 0 ≤ i < n) contains a string, dictionary[i].
The next line contains an integer, q, the number of strings in query[].
Each line i of the q subsequent lines (where 0 ≤ i < q) contains a string, query[i].
Sample Case 0
Sample Input
STDIN Function
----- -----
5 → dictionary[] size n = 5
heater → dictionary = ['heater', 'cold', 'clod', 'reheat', 'docl']
cold
clod
reheat
docl
3 → query[] size q = 3
codl → query = ['codl', 'heater', 'abcd']
heater
abcd
Sample Output
3
2
0
Explanation
query[0] = 'codl' has 3 anagrams in dictionary: 'cold', 'clod' and 'docl'.
query[1] = 'heater' has 2 anagrams in dictionary: 'heater' and 'reheat'.
query[2] = 'abcd' has 0 anagrams in dictionary.
The final answer is [3, 2, 0].
Sample Case 1
Sample Input
STDIN Function
----- -----
8 → dictionary[] size n = 8
listen → dictionary = ['listen', 'tow', 'silent', 'lisent', 'two', 'abc', 'no', 'on']
tow
silent
lisent
two
abc
no
on
4 → query[] size q = 4
two → query = ['two', 'bca', 'no', 'listen']
bca
no
listen
Sample Output
2
1
2
3
Explanation
query[0] = 'two' has 2 anagrams in dictionary: 'tow' and 'two'.
query[1] = 'bca' has 1 anagram in dictionary: 'abc'.
query[2] = 'no' has 2 anagrams in dictionary: 'no' and 'on'.
query[3] = 'listen' has 3 anagrams in dictionary: 'listen', 'silent' and 'lisent'.
The final answer is [2, 1, 2, 3].
```