Finding subset of a set

Question

Here is my program to Check if arr1 is a subset of arr2. But there is a bug when arr2 is not a subset of arr1. I am trying to implement the algorithm of it in python. But what is the best way to if it is not in the frequency table?

def isSubset(arr1, arr2):
    frequency = {}

    for i in range(0, len(arr1)):
        if arr1[i] in frequency:
            frequency[arr1[i]] = frequency[arr1[i]] + 1
        else:
            frequency[arr1[i]] = 1

    for i in range(0, len(arr2)):
        if frequency[arr2[i]] > 0:
            frequency[arr2[i]] -= 1
        else:
            return False

    return True

isSubset(['a'],['b']) # KeyError: 'b'

The most Pythonic way to check for a subset is to use... a set, where there is already a `issubset` method. — blhsing, Sep 23 '22 at 02:08
```for i in range(0, len(arr1)):``` could be replace by `for arr in arr1:` — ElapsedSoul, Sep 23 '22 at 02:10

score 1 · Accepted Answer · answered Sep 23 '22 at 02:14

1

To fix the KeyError that your code is getting, you can use the dict.get method to return a default value of 0 when given a non-existing key.

Change:

if frequency[arr2[i]] > 0:

to:

if frequency.get(arr2[i], 0) > 0:

answered Sep 23 '22 at 02:14

blhsing

91,368
6
71
106

Finding subset of a set

1 Answers1

Linked