Skip to main content

Python - Set Functions - add, clear, difference, discard, intersection, checks, union, update

🐍 Advanced Sets

Let's create a blank set and learn by example.
Input
s = Set()

Add Elements to Set

Input
s.add(1)
s.add(2)
s
Output
{1, 2}
This adds new elements to our existing set.

Clear

Input
s.clear()
s
Output
set()
This empties the set. It deletes all elements.

Copy

Input
s = {1,2,3}
sc = s.copy()
print(s,sc)
Output
{1, 3, 4} {1, 2, 3}
This copies elements from one set to another.

Difference

Syntax
set1.difference(set2)
Input
s.add(4)
s.difference(sc)
Output
{4}
This returns elements that are not common in the two sets.

Difference Update

Syntax
set1.difference_update(set2)
Input
s1 = {1,2,3}
s2 = {1,4,5}
s1.difference_update(s2)
s1
Output
{2, 3}
This updates set1 to the difference between set1 and set2.

Discard

Syntax
set.discard(element)
Input
s = {1,2,3,4}
s.discard(2)
s
Output
{1, 3, 4}
This deletes an element from the set, if that element exists in the set.

Intersection

Syntax
set1.intersection(set2)
Input
s1 = {1,2,3}
s2 = {2,3,4}
s1.intersection(s2)
Output
{2, 3}
It returns the elements that are common in the two sets. It does NOT update any of the two sets.

Intersection Update

Syntax
set1.intersection_update(set2)
Input
s1 = {1,2,3}
s2 = {2,3,4}
s1.intersection(s2)
s1
Output
{2, 3}
It updates set1 with common elements between the two sets.

Is Disjoint?

Syntax
set1.isdisjoint(set2)
Input
s1 = {1,2,3}
s2 = {2,3,4}
s1.isdisjoint(s2)
Output
False
Input
s1 = {1,2,3}
s3 = {4,5,6}
s1.isdisjoint(s3)
Output
True
It returns True or False. Returns True if both sets are unique to each other, i.e. no common element in the two sets, else it returns false.

Is Subset?

Syntax
set1.issubset(set2)
Input
s1 = {1,2}
s2 = {1,2,3}
s1.issubset(s2)
Output
True
Input
s2.issubset(s1)
Output
False
It returns True or False. Returns True if set1 is subset of set2, else it returns false.

Is Superset?

Syntax
set1.issuperset(set2)
Input
s1 = {1,2,3}
s2 = {1,2}
s1.issuperset(s2)
Output
True
Input
s2.issuperset(s1)
Output
False
It returns True or False. Returns True if set1 is superset of set2, else it returns false.

Symmetric Difference?

Syntax
set1.symmetric_difference(set2)
Input
s1 = {1,2,3}
s2 = {1,2,4}
s1.symmetric_difference(s2)
Output
{3, 4}
It returns a set. A set of all the elements that are not common is returned.

Union?

Syntax
set1.union(set2)
Input
s1 = {1,2,3}
s2 = {1,2,4}
s1.union(s2)
Output
{1, 2, 3, 4}
It returns a set. A set of all the elements in both the sets, but just one occurrence of each element, is returned. Note that the returned set is not saved in set1 or set2.

Update?

Syntax
set1.update(set2)
Input
s1 = {1,2,3}
s2 = {1,2,4}
s1.update(s2)
s1
Output
{1, 2, 3, 4}
It saves a set in set1. A set of all the elements in both the sets, but just one occurrence of each element, is returned. This is similar to union, just that in this it updates set1 with the new set created.

Comments

Popular posts from this blog

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.

Machine Learning — Supervised, Unsupervised, and Reinforcement — Explanation with Example

🤖 Let's take an example of machine learning and see how it can be performed in three different ways — Supervised, Unsupervised, and Reinforcement. We want a program to be able to identify apple in pictures Supervised Learning You will create or use a model that takes a set of pictures of apple and it analyses the commonality in those pictures. Now when you show a new picture to the program, it will identify whether it has an apple or not. It can also provide details on how confident is the program about it. Unsupervised Learning In this method, you create or use a model that goes through some images and tries to group them as per the commonalities it observes such as color, shape, size, partern, etc. And now you can go through the groups and inform the program what to call them. So, you can inform the program about the group that is apple mostly. Next time you show a picture, it can tell if an apple is there or not. Reinforcement Learning Here the model you create or...

269. Alien Dictionary

  Solution This article assumes you already have some confidence with  graph algorithms , such as  breadth-first search  and  depth-first searching . If you're familiar with those, but not with  topological sort  (the topic tag for this problem), don't panic, as you should still be able to make sense of it. It is one of the many more advanced algorithms that keen programmers tend to "invent" themselves before realizing it's already a widely known and used algorithm. There are a couple of approaches to topological sort;  Kahn's Algorithm  and DFS. A few things to keep in mind: The letters  within a word  don't tell us anything about the relative order. For example, the presence of the word  kitten  in the list does  not  tell us that the letter  k  is before the letter  i . The input can contain words followed by their prefix, for example,  abcd  and then  ab . These cases will never ...