set

# You can't create a set like this in Python
my_set = {} # ---- This is a Dictionary/Hashmap

# To create a empty set you have to use the built in method:
my_set = set() # Correct!


set_example = {1,3,2,5,3,6}
print(set_example)

# OUTPUT
# {1,3,2,5,6} ---- Sets do not contain duplicates and are unordered

View another examples Add Own solution

3.2

Awgiedawgie 440220 points

                                    Set&lt;String&gt; names = new HashSet&lt;&gt;();
names.add(&quot;John&quot;);
names.add(&quot;Jack&quot;);
names.add(&quot;John&quot;);
System.out.println(names); // [John, Jack]

names.remove(&quot;John&quot;);

boolean contains = names.contains(&quot;Jack&quot;); // true

for (String name: names) {
    System.out.println(name);
}

Thank you! 5

3.2 (5 Votes)

Krish 100200 points

                                    @echo off 
set a[0]=1 
set a[1]=2  
set a[2]=3 
Rem Setting the new value for the second element of the array 
Set a[1]=5 
echo The new value of the second element of the array is %a[1]%

Thank you! 1

3 (1 Votes)

Krish 100200 points

                                    When to use List, Set and Map?
If we need to access elements frequently by using index, then List is a way 
to go ArrayList provides faster access if we know index.
If we want to store elements and want them to maintain an order, 
then go for List again. List is an ordered collection and maintain order.
If we want to create collection of unique elements and don't want
any duplicate than choose any Set implementation. (HashSet... )
If we want store data in form Key and Value than Map is the way to go.
We can choose from HashMap, Hashtable...

Thank you! 10

4 (10 Votes)

A-312 69370 points

                                    basket = {'apple', 'orange', 'apple', 'pear', 'orange', 'banana'}
print(basket)                      # show that duplicates have been removed
# OUTPUT {'orange', 'banana', 'pear', 'apple'}
print('orange' in basket)                 # fast membership testing
# OUTPUT True
print('crabgrass' in basket)
# OUTPUT False

# Demonstrate set operations on unique letters from two words

print(a = set('abracadabra'))
print(b = set('alacazam'))
print(a)                                  # unique letters in a
# OUTPUT {'a', 'r', 'b', 'c', 'd'}
print(a - b)                             # letters in a but not in b
# OUTPUT {'r', 'd', 'b'}
print(a | b)                              # letters in a or b or both
# OUTPUT {'a', 'c', 'r', 'd', 'b', 'm', 'z', 'l'}
print(a &amp; b)                              # letters in both a and b
# OUTPUT {'a', 'c'}
print(a ^ b)                              # letters in a or b but not both
# OUTPUT {'r', 'd', 'b', 'm', 'z', 'l'}

Thank you! 0

Krish 100200 points

                                    
SET: Can only store unique values, 
     And does not maintain order
- HashSet can have null, order is not guaranteed
- LinkedHashSet can have null and keeps the order 
- TreeSet sorts the order and don't accept null

Thank you! 2

Are there any code examples left?

Find Add Code snippet

New code examples in category Other

Other 2023-03-27 22:50:10 how to select the whole line in vscode with keyboard shortcut
Other 2022-03-27 22:45:24 income of a web developer
Other 2022-03-27 22:35:01 \pyrcc_main.py: File does not exist 'resources.qrc'
Other 2022-03-27 22:30:45 rick roll embed code
Other 2022-03-27 22:20:08 Circuit_04_Potentiometer
Other 2022-03-27 22:20:05 iterative power
Other 2022-03-27 22:15:11 flutter run all
Other 2022-03-27 22:10:05 when is karlson release
Other 2022-03-27 22:10:02 wp .htaccess example
Other 2022-03-27 22:00:08 bash pause in file read line by line

Create a Free Account

Unlock the power of data and AI by diving into Python, ChatGPT, SQL, Power BI, and beyond.

Develop soft skills on BrainApps

Complete the IQ Test

Relative searches

set

Welcome Back!

Create a Free Account