Remove All Duplicates from a Given String in Python
Last Updated :
28 Feb, 2025
The task of removing all duplicates from a given string in Python involves retaining only the first occurrence of each character while preserving the original order. Given an input string, the goal is to eliminate repeated characters and return a new string with unique characters. For example, with s = "geeksforgeeks", the result would be "geksfor".
Using orderedDict.fromkeys()
OrderedDict efficiently remove duplicates from a string while preserving the order of characters. It works by converting the string into an ordered dictionary where each character is a key, ensuring only unique characters remain.
Python
from collections import OrderedDict
s = "geeksforgeeks"
res = "".join(OrderedDict.fromkeys(s))
print(res)
Explanation: This method creates an ordered dictionary of unique characters from the string and returns them in the original order.
Using dict.fromkeys()
Similar to OrderedDict, this method uses a regular dictionary which maintains insertion order to remove duplicates. It’s highly efficient, maintaining the order of characters and removing any repetitions.
Python
s = "geeksforgeeks"
res = "".join(dict.fromkeys(s))
print(res)
Explanation: This method uses a dictionary to remove duplicates while keeping the insertion order, similar to OrderedDict, but with slightly less overhead.
Using for loop
This approach removes duplicates by iterating through the string with a for loop, tracking previously seen characters using a set. The first occurrence of each character is added to the result string, which preserves the order.
Python
s = "geeksforgeeks"
seen = set() # track unique characters
res = "" # result string
for char in s:
if char not in seen:
seen.add(char)
res += char
print(res)
Explanation: This method checks if a character is already in the set and if not, it adds it to the result string, preserving the original order of characters.
Using set()
This method uses list comprehension combined with a set to remove duplicates. While the method preserves order by checking each character against the set, it introduces slicing overhead that can reduce performance, especially for larger strings.
Python
s = "geeksforgeeks"
res = "".join([char for i, char in enumerate(s) if char not in s[:i]])
print(res)
Explanation: List comprehension iterates through the string s, adding each character to res only if it has not appeared before (i.e., it is not present in the substring s[:i]), effectively removing duplicates while maintaining order.
Similar Reads
Python Tutorial | Learn Python Programming Language Python Tutorial â Python is one of the most popular programming languages. Itâs simple to use, packed with features and supported by a wide range of libraries and frameworks. Its clean syntax makes it beginner-friendly.Python is:A high-level language, used in web development, data science, automatio
10 min read
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Python Interview Questions and Answers Python is the most used language in top companies such as Intel, IBM, NASA, Pixar, Netflix, Facebook, JP Morgan Chase, Spotify and many more because of its simplicity and powerful libraries. To crack their Online Assessment and Interview Rounds as a Python developer, we need to master important Pyth
15+ min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Python OOPs Concepts Object Oriented Programming is a fundamental concept in Python, empowering developers to build modular, maintainable, and scalable applications. By understanding the core OOP principles (classes, objects, inheritance, encapsulation, polymorphism, and abstraction), programmers can leverage the full p
11 min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read