Check duplicates in a stream of strings

Check duplicates in a stream of strings

Given an array arr[] of strings containing the names of employees in a company. Assuming that the names are being entered in a system one after another, the task is to check whether the current name is entered for the first time or not.
Examples:
Input: arr[] = {“geeks”, “for”, “geeks”}
Output:
No
No
Yes
Approach: Create an unordered_set to store the names of the employees and start traversing the array, if the current name is already present in the set then print Yes else print No and insert it into the set.
Below is the implementation of the above approach:
// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
  
// Function to insert the names
// and check whether they appear
// for the first time
void insertNames(string arr[], int n)
{
  
    // To store the names
    // of the employees
    unordered_set<string> set;
    for (int i = 0; i < n; i++) {
  
        // If current name is appearing
        // for the first time
        if (set.find(arr[i]) == set.end()) {
            cout << "No\n";
            set.insert(arr[i]);
        }
        else {
            cout << "Yes\n";
        }
    }
}
  
// Driver code
int main()
{
    string arr[] = { "geeks", "for", "geeks" };
    int n = sizeof(arr) / sizeof(string);
  
    insertNames(arr, n);
  
    return 0;
}
Output:
No
No
Yes

// Java implementation of the approach
import java.util.*;
  
class GFG 
{
  
// Function to insert the names
// and check whether they appear
// for the first time
static void insertNames(String arr[], int n)
{
  
    // To store the names
    // of the employees
    HashSet<String> set = new HashSet<String>();
    for (int i = 0; i < n; i++) 
    {
  
        // If current name is appearing
        // for the first time
        if (!set.contains(arr[i]))
        {
            System.out.print("No\n");
            set.add(arr[i]);
        }
        else 
        {
            System.out.print("Yes\n");
        }
    }
}
  
// Driver code
public static void main(String[] args)
{
    String arr[] = { "geeks", "for", "geeks" };
    int n = arr.length;
  
    insertNames(arr, n);
}
}
  
// This code contributed by PrinciRaj1992
Output:
No
No
Yes



# Python3 implementation of the approach
  
# Function to insert the names 
# and check whether they appear 
# for the first time 
def insertNames(arr, n) : 
  
    # To store the names 
    # of the employees 
    string = set();
      
    for i in range(n) :
  
        # If current name is appearing 
        # for the first time 
        if arr[i] not in string :
            print("No"); 
            string.add(arr[i]); 
      
        else : 
            print("Yes"); 
      
# Driver code 
if __name__ == "__main__" : 
  
    arr = [ "geeks", "for", "geeks" ]; 
    n = len(arr); 
  
    insertNames(arr, n); 
  
# This code is contributed by AnkitRai01
Output:
No
No
Yes





























































Comments

Post a Comment

Popular posts from this blog

[13 Feb 2020] Check if a given sequence of moves for a robot is circular or not

Check if a given sequence of moves for a robot is circular or not Link:  https://www.youtube.com/watch?v=f7Zd8hEbCz0 Given a sequence of moves for a robot, check if the sequence is circular or not. A sequence of moves is circular if first and last positions of robot are same. A move can be on of the following. G - Go one unit L - Turn left R - Turn right Input: path[] = "GLGLGLG" Output: Given sequence of moves is circular Input: path[] = "GLLG" Output: Given sequence of moves is circular The idea is to consider the starting position as (0, 0) and direction as East (We can pick any values for these). If after the given sequence of moves, we come back to (0, 0), then given sequence is circular, otherwise not. N | | W -------------- E | | S The move ‘G’ changes either x or y according to following rules. a) If current direction is North, then ‘G’ increments y and doesn’t cha...
Read more

[1] C++ Interview Questions

Image
C/C++ Complete Program Preparation Memory Layout of C Programs Question 9. Can You Name A Situation Where Joining Threads Should Be Avoided? Answer : A call to join() blocks the caller thread. This is really bad in situations where the caller thread is a main UI thread – because if the UI thread blocks, the application will stop responding to user inputs which will make it seem hanged. Another place where calling join() is not advisable is inside a main game loop. Calling join() can block update and rendering of the game scene and severly impact the user experience (it'll be like watching a You tube video on a dial up internet connection !). https://www.wisdomjobs.com/e-university/c-multithreading-developer-interview-questions.html https://www.wisdomjobs.com/e-university/c-multithreading-developer-interview-questions.html https://www.wisdomjobs.com/e-university/advanced-c-plus-plus-interview-questions.html C++ Preparation             ...
Read more
Image
  C Program to Check if a Given String is Palindrome // A function to check if a string str is palindrome void isPalindrome( char str[]) {      // Start from leftmost and rightmost corners of str      int l = 0;      int h = strlen (str) - 1;          // Keep comparing characters while they are same      while (h > l)      {          if (str[l++] != str[h--])          {              printf ( "%s is Not Palindrome" , str);              return ;          }      }      printf ( "%s is palindrome" , str); }     // Driver program to test above function int main() {...
Read more