Question

This lab continues to work with C++ arrays and introduces vectors

1)     First, most code that works on arrays can solve a problem using a single loop. One problem where this is not true is if you need to check if there are any duplicates in the array.

·In a file called duplicates.cpp write a function hasDups(string strs[], int numStrs) that returns true if there are any duplicates in the names array

·Write main() to simulate reading in a single ranked choice ballot and confirm it is valid

o   A ranked choice ballot means you get to vote for more than one candidate

o   The order of your choices indicates who is your first choice, second choice and so on

o   We will read the “ballot” from cin and only check for duplicate names

o   After reading in the choices, main() should call hasDups() to check for duplicates

o   Assume the ballot has no more than 5 choices

·Here are two sample runs

Enter up to 5 choices for the primary, in order

Biden

Harris

Biden

^Z

Sorry, you have chosen the same person more than once

­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­________________________________________

Enter up to 5 choices for the primary, in order

Warren

Booker

Buttigieg

Sanders

Yang

^Z

Ballot is valid

Answer 1

#include <bits/stdc++.h>
using namespace std;

int hasDup(string arr[], int n)
{
set < string > s;
for(int i = 0; i < n; i++)
{
if(s.find(arr[i]) != s.end())
return 1;
else
s.insert(arr[i]);
}
return 0;
}

int main()
{
cout<<"Enter up to 5 choices for the primary, in order";
int n = 5;
  
string arr[n];
for(int i = 0; i < n; i++)
{
cin >> arr[i];
}
  
if(hasDup(arr, n))
cout << "Sorry, you have chosen the same person more than once";
else
cout << "Ballot is valid";

return 0;
}

/* In this question, i have used a set to store values of string array to check for duplicates because a set cant have duplicates. So we keep on adding the elements of array into set and check if the element is present or not. If present, then return 1 else return 0.

*/