C++ Remove Duplicates From String














































C++ Remove Duplicates From String



.

Remove duplicates from a string in O(1) extra space


Given a string str of lowercase characters, the task is to remove duplicates and return a resultant string without modifying the order of characters in the original string.

Examples:  

Input: str = geeksforgeeks
Output: geksfor

Input: str = characters
Output: chartes

Approach: The idea is to use bits of a counter variable to mark the presence of a character in the string. To mark the presence of a set 0th bit as 1, for b set 1st bit as 1 and so on. If the corresponding bit of character present in the original string is set to 0, it means it is the first occurrence of that character, hence set its corresponding bit as 1 and keep on including the current character in the resultant string.

Consider the string str = geeksforgeeks

  • character: g
    x = 6(ascii of g  97) 
    6th bit in counter is unset resulting first occurrence of character g. 
    str[0] = g
    counter = 00000000000000000000000001000000 // mark 6th bit as visited 
    length = 1
  • character: e
    x = 4(ascii of e 97) 
    4th bit in counter is unset resulting in first occurrence of character e 
    str[1] = e 
    counter = 00000000000000000000000001010000 //mark 4th bit as visited 
    length = 2
  • character: e
    x = 4(ascii of e  97) 
    4th bit in counter is set resulting in duplicate character. 
    Ignore this character. Move for next character. 
    counter = 00000000000000000000000001010000 //same as previous 
    length = 2
  • character: k 
    x = 10(ascii of k  97) 
    10th bit in counter is unset resulting in first occurrence of character k. 
    str[2] = k 
    counter = 00000000000000000000010001010000 //mark 10th bit as visited 
    length = 3

Similarly, do the same for all characters.
Resultant string : geksfor(string of length 7 starting from index 0) 

Algorithm: 

  1. Initialize a counter variable (keeps track of the characters visited in string), it is a 32 bit Integer represented as(00000000000000000000000000000000) initially.
  2. Consider a as 0th bit of counter, b as 1st bit of counter, c  as 2nd bit of counter and so on.
  3. Traverse through each character of input string.
  4. Get the character s value, where character  s value(x) = Ascii of character  97. This will make sure for value of  a  a   s 0, value of  b  as 1 and so on.
  5. Check xth bit of counter.
  6. If Xth bit of counter is 0 which means the current character has appeared for the first time, keep the current character at the index  length  of string .
  7. Mark the current character visited by setting xth bit of counter.
  8. Increment length.
  9. Return Substring of size  length  from index 0.

Below is the implementation of above approach: 

// C++ implementation of above approach
#include <bits/stdc++.h>
#include <string>
using namespace std;

// Function to remove duplicates
string removeDuplicatesFromString(string str)
{

    // keeps track of visited characters
    int counter = 0;

    int i = 0;
    int size = str.size();

    // gets character value
    int x;

    // keeps track of length of resultant string
    int length = 0;

    while (i < size) {
        x = str[i] - 97;

        // check if Xth bit of counter is unset
        if ((counter & (1 << x)) == 0) {

            str[length] = 'a' + x;

            // mark current character as visited
            counter = counter | (1 << x);

            length++;
        }
        i++;
    }

    return str.substr(0, length);
}

// Driver code
int main()
{
    string str = "geeksforgeeks";
    cout << removeDuplicatesFromString(str);
    return 0;
}


Output: 
geksfor

Time Complexity: O(n) 
Space Complexity: O(n) -> As it uses char[] array of string to store characters of string (i.e. dependent upon length of input string)



More Articles of M Mounika:

Name Views Likes
C++ Segmented Sieve (Print Primes In a Range) 162 0
C++ Sieve Of Erastosthenes 135 0
C++ Gold Mine Problem 295 0
C++ Merge K Sorted Arrays 117 0
C++ K Centers Problem 240 0
C++ Find Nth Catalan Number 311 0
C++ Inplace Rotate square matrix by 90 degrees 286 0
C++ Find Non Repeating Elements in Array 87 0
C++ Merge Two Binary Trees 121 0
C++ Sum of Numbers From Root To Leaf Paths 89 0
C++ Meta Strings 91 0
C++ Flood Fill Algorithm 402 0
C++ smallest substring with maximum distinct characters 200 0
C++ Smallest window with all characters in string 94 0
C++ Minimum Removal of Characters from string to make its permutation as palindrome 87 0
C++ Minimum characters added at front of string in palindrome conversion 69 0
C++ Number of Bracket Reversals needed to make expression Balanced 72 0
C++ String to Palindrome with Append Function 83 0
C++ WildCard pattern matching 76 0
C++ Anagram substring Search 72 0
C++ Manachars Algorithm 74 0
C++ Search String in Grid 83 0
C++ String Matching(Z Algorithm) 67 0
C++ String Matching(Naive Algorithm) 114 0
C++ String Matching(KMP Algorithm) 141 0
C++ Remove Duplicates From String 111 0
C++ Basics of String Manipulation 85 1
C++ Disjoint Data Structure Cycle Detection 87 0
C++ Problem On Disjoint Data Structures 95 0
C++ Disjoint Data Structures Part3 79 0
Disjoint Data Structures Part2 90 0
Disjoint Data Structures 93 1
C++ Segment Trees 321 2
C++ Trie Cost of Data 291 1
C++ Trie Datastructure 279 1
C++ Greedy Approach Minimum number of coins 526 0
C++ Greedy Approach Maximum height Pyramid 329 1
C++ Greedy Approach String lexicographically largest subsequence 247 0
C++ Greedy Approach Lexicographically largest subsequence 364 0
C++ Greedy Approach Prims MST 398 1
C++ Greedy Approach Krushkals MST 458 1
C++ Greedy Approach N-array maximum sum 334 1
C++ Greedy Approach Policemen Catch Thieves 563 1
C++ Greedy Approach Maximum product Subset 546 1
C++ Greedy Approach Minimum Product Subset 349 1
C++ Greedy Approach Fractional Knapsack 737 1
C++ Greedy Approach-Activity Selection Problem 745 1
C++ Greedy Approach-Egyptian Fractions 640 0
C++ Greedy Approach-Huffman Codes 1031 1
C++ Introduction to Greedy Approach 955 2

Comments