Write a Python code snippet to print the unique elements of a given list.
- User
Write a Python code snippet to print the unique elements of a given list.
Assistant
-
Core Problem: Remove duplicates from a list and print unique elements
-
Key Considerations:
- Order Preservation: Should we maintain original order?
- Hashability: Can all elements be hashed? (sets require hashable elements)
- Performance: Time and space complexity matter for large lists
- Data Types: Handling mixed types, None values, etc.
-
Approach Comparison:
set(): O(n) time, loses order, requires hashable elementsdict.fromkeys(): O(n) time, preserves order (Python 3.7+)- Loop with membership check: O(n²) time, preserves order, works with unhashable
-
Best Practices: Provide multiple solutions for different scenarios
Finding Unique Elements in a List - Python Solution
Analysis & Design Considerations
Implementation
Solution 1: Using
set()- Simplest Approachdef print_unique_set(input_list): """Print unique elements using set (order NOT preserved).""" unique_elements = set(input_list) print("Unique elements:", unique_elements) # Or iterate to print each for element in unique_elements: print(element, end=' ') print() # Newline # Example usage my_list = [1, 2, 3, 2, 4, 3, 5, 1, 6] print_unique_set(my_list) # Output: Unique elements: {1, 2, 3, 4, 5, 6}Time Complexity: O(n) | Space Complexity: O(n)
Solution 2: Using
dict.fromkeys()- Order Preserved (Recommended)def print_unique_ordered(input_list): """Print unique elements while preserving original order.""" # dict.fromkeys() creates keys from list (keys are unique) # Python 3.7+ guarantees insertion order unique_elements = list(dict.fromkeys(input_list)) print("Unique elements (ordered):", unique_elements) return unique_elements # Example usage my_list = [1, 2, 3, 2, 4, 3, 5, 1, 6] print_unique_ordered(my_list) # Output: Unique elements (ordered): [1, 2, 3, 4, 5, 6]Time Complexity: O(n) | Space Complexity: O(n)
Solution 3: Complete Robust Solution
def print_unique_elements(input_list, preserve_order=True): """ Print unique elements from a given list. Args: input_list: List of elements (can be any iterable) preserve_order: If True, maintains original order of first occurrences Returns: List of unique elements """ if not input_list: print("Empty list provided.") return [] try: if preserve_order: # Maintains order, O(n) complexity unique = list(dict.fromkeys(input_list)) else: # Faster but unordered, O(n) complexity unique = list(set(input_list)) # Print results print(f"Original list: {input_list}") print(f"Unique elements: {unique}") print(f"Count: {len(input_list)} → {len(unique)} (removed {len(input_list) - len(unique)} duplicates)") return unique except TypeError as e: # Handle unhashable elements (like nested lists) print(f"Error: List contains unhashable elements. Using alternative method.") return print_unique_unhashable(input_list) def print_unique_unhashable(input_list): """Handle lists with unhashable elements (e.g., nested lists).""" unique = [] for item in input_list: if item not in unique: # O(n²) but necessary for unhashable types unique.append(item) print(f"Unique elements: {unique}") return unique # ============ DEMONSTRATION ============ if __name__ == "__main__": # Test Case 1: Integers print("=" * 40) print("Test 1: Integers with duplicates") numbers = [1, 2, 3, 2, 4, 3, 5, 1, 6] print_unique_elements(numbers) # Test Case 2: Strings print("\n" + "=" * 40) print("Test 2: Strings") fruits = ["apple", "banana", "apple", "cherry", "banana", "date"] print_unique_elements(fruits) # Test Case 3: Mixed types print("\n" + "=" * 40) print("Test 3: Mixed data types") mixed = [1, "hello", 2, "hello", 1, 3.14, 2] print_unique_elements(mixed) # Test Case 4: Without order preservation print("\n" + "=" * 40) print("Test 4: Without order preservation") print_unique_elements(numbers, preserve_order=False)
Output Example
======================================== Test 1: Integers with duplicates Original list: [1, 2, 3, 2, 4, 3, 5, 1, 6] Unique elements: [1, 2, 3, 4, 5, 6] Count: 9 → 6 (removed 3 duplicates) ======================================== Test 2: Strings Original list: ['apple', 'banana', 'apple', 'cherry', 'banana', 'date'] Unique elements: ['apple', 'banana', 'cherry', 'date'] Count: 6 → 4 (removed 2 duplicates)
Quick One-Liners
# If order doesn't matter: unique = list(set(my_list)) # If order matters (Python 3.7+): unique = list(dict.fromkeys(my_list)) # Print directly: print(*dict.fromkeys(my_list)) # Prints: 1 2 3 4 5 6
Summary Table
Method Order Preserved Time Space Hashable Required set()❌ O(n) O(n) ✅ Yes dict.fromkeys()✅ O(n) O(n) ✅ Yes Loop + not in✅ O(n²) O(n) ❌ No Recommendation: Use
list(dict.fromkeys(input_list))for most cases—it's O(n), preserves order, and is Pythonic.-