Set creation and operations in Swift - Time & Space Complexity

Time Complexity: Set creation and operations

O(n)

Understanding Time Complexity

When we create and work with sets in Swift, it's important to know how the time it takes changes as the set grows.

We want to find out how fast operations like adding or checking items happen when the set gets bigger.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

var numbers = Set()
for i in 1...n {
    numbers.insert(i)
}
let containsCheck = numbers.contains(n / 2)
    

This code creates a set by adding numbers from 1 to n, then checks if a number is in the set.

Identify Repeating Operations

• Primary operation: Inserting elements into the set inside the loop.
• How many times: The insert operation runs n times, once for each number from 1 to n.
• Additional operation: Checking if the set contains a number happens once.

How Execution Grows With Input

As n grows, the number of insert operations grows directly with n, because each number is added once.

Input Size (n)	Approx. Operations
10	About 10 insertions + 1 check
100	About 100 insertions + 1 check
1000	About 1000 insertions + 1 check

Pattern observation: The work grows steadily as the input size grows; doubling n roughly doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to create the set grows in a straight line with the number of items added.

Common Mistake

[X] Wrong: "Checking if a set contains an item takes time proportional to the size of the set."

[OK] Correct: Sets are designed to check membership very quickly, usually in constant time, no matter how big the set is.

Interview Connect

Understanding how set operations scale helps you explain efficient data handling clearly and confidently in real-world coding situations.

Self-Check

"What if we changed the set to an array and performed the same insert and contains operations? How would the time complexity change?"

Practice

1. What is true about a Set in Swift?

easy

A. It can only store numbers, not strings.

B. It stores duplicate values in the order they were added.

C. It stores unique values without any specific order.

D. It always keeps elements sorted alphabetically.

Solution

1. Step 1: Understand Set properties

   A Set in Swift stores unique values and does not keep any order.

2. Step 2: Compare options with Set behavior

   It stores unique values without any specific order. matches the unique and unordered nature of Sets. Others describe arrays or sorted collections.

3. Final Answer:

   It stores unique values without any specific order. -> Option C

4. Quick Check:

   Set = unique + unordered [OK]

Hint: Remember: Sets never keep duplicates or order [OK]

Common Mistakes:

• Thinking Sets keep order like arrays
• Assuming Sets allow duplicates
• Believing Sets only store numbers

2. Which of the following is the correct way to create a Set of integers in Swift?

easy

A. let numbers = {1, 2, 3, 4} as Set<Int>

B. let numbers: Set<Int> = [1, 2, 3, 4]

C. let numbers = Set(1, 2, 3, 4)

D. let numbers = [1, 2, 3, 4] as Set

Solution

1. Step 1: Recall Set creation syntax

   In Swift, a Set can be created by specifying type and using square brackets with values.

2. Step 2: Check each option's syntax

   let numbers: Set<Int> = [1, 2, 3, 4] uses correct syntax: Set<Int> = [1, 2, 3, 4]. Others have syntax errors or wrong casting.

3. Final Answer:

   let numbers: Set<Int> = [1, 2, 3, 4] -> Option B

4. Quick Check:

   Set creation = type + brackets [OK]

Hint: Use Set<Type> with brackets for values [OK]

Common Mistakes:

• Using parentheses instead of brackets
• Trying to cast arrays directly to Set without syntax
• Missing type declaration when needed

3. What will be the output of this Swift code?

let setA: Set<Int> = [1, 2, 3, 4]
let setB: Set<Int> = [3, 4, 5, 6]
let result = setA.intersection(setB)
print(result.sorted())

medium

A. [3, 4]

B. [1, 2]

C. [5, 6]

D. [1, 2, 3, 4, 5, 6]

Solution

1. Step 1: Understand intersection operation

   Intersection returns elements common to both sets. Here, common elements are 3 and 4.

2. Step 2: Check printed output

   Result is converted to a sorted array, so output is [3, 4].

3. Final Answer:

   [3, 4] -> Option A

4. Quick Check:

   Intersection = common elements [OK]

Hint: Intersection = only items in both sets [OK]

Common Mistakes:

• Confusing intersection with union
• Forgetting to sort before printing
• Expecting all elements combined

4. Identify the error in this Swift code snippet:

var fruits: Set<String> = ["apple", "banana", "orange"]
fruits.append("grape")

medium

A. The brackets [] cannot be used to create a Set.

B. You cannot add strings to a Set of strings.

C. The Set must be declared as a constant, not variable.

D. Sets do not have an append method.

Solution

1. Step 1: Check Set modification methods

   Sets use insert() to add elements, not append().

2. Step 2: Analyze the code error

   Calling append() on a Set causes a compile error because it is not defined for Set.

3. Final Answer:

   Sets do not have an append method. -> Option D

4. Quick Check:

   Use insert() to add to Set [OK]

Hint: Use insert(), not append(), to add Set items [OK]

Common Mistakes:

• Using append() instead of insert()
• Thinking Sets are immutable by default
• Confusing array and Set methods

5. Given two sets:

let setX: Set<Int> = [1, 2, 3, 4, 5]
let setY: Set<Int> = [4, 5, 6, 7]

Which Swift code correctly creates a new set containing elements in either setX or setY but not in both?

hard

A. let result = setX.symmetricDifference(setY)

B. let result = setX.union(setY)

C. let result = setX.intersection(setY)

D. let result = setX.subtracting(setY)

Solution

1. Step 1: Understand symmetricDifference

   Symmetric difference returns elements in either set but not in both.

2. Step 2: Compare with other operations

   Union combines all elements, intersection finds common, subtracting removes elements of second from first.

3. Final Answer:

   let result = setX.symmetricDifference(setY) -> Option A

4. Quick Check:

   Symmetric difference = exclusive elements [OK]

Hint: SymmetricDifference = items in one set only [OK]

Common Mistakes:

• Using union instead of symmetricDifference
• Confusing intersection with symmetricDifference
• Using subtracting which is one-sided