I need to writea program that takes two strings and puts them together to output one string.   string intersection(string s1, string s2){s1.erase(remove(s1.begin(), s2.end(), ' ')), (s2.end());return s2;} int main() {string s1;string s2;getline(cin, s1);s1 = intersection(s1, s2);cout << s1 << endl; return 0;} Please fix my c++ program.

Write code in assembly language Question 1: Construct a program using 2D array. Define a list of strings in the 2D arrays, the list should be only a string. Get a string from a user as input Search the user's string in the list of strings. If string is found print the string, and a message "String is Found". If string is not found print only a message "String is Not Found".

Using c++ Contact list: Binary Search   A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…

In the following program skeleton, replace the < insert code here> line with theappropriate code. The resulting program should display the initial list of songs,prompt the user for a string of text to be replaced and then prompt for new text toreplace it. After making the replacement, it should display the updated list of songs.import java.util.Scanner;public class UpdateSongs{public static void main ( String [] args){Scanner stdIn = new Scanner(System.in);String songs =“ 1. Welcome to Your Life – Grouplove\n” +“ 2. Sedona – Houndmouth\n” +“3. Imagine – John Lennon\n” +“4. Bohemian Rhapsody –Queen\n”;String oldText, newText;< insert code here>}}Sample Session:1. Welcome to Your Life – Grouplove”2. Sedona – Houndmouth3. Imagine – John Lennon4. Bohemian Rhapsody –QueenEnter text to replace: LennonEnter new text: Dean1. Welcome to Your Life – Grouplove”2. Sedona – Houndmouth3. Imagine – John Dean4. Bohemian Rhapsody –Queen

def findOccurrences(s, ch):     lst = []     for i in range(0, len(s)):         if a==s[i]:             lst.append(i)     return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n):     word = input("welcome!")     guesses = ''     turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word):            secrete_word = "-" * len(word)     print(" the secrete word " + secrete_word)         user_input = input("Guess a letter: ")         if user_input in word:         occurences = findOccurrences(word, user_input)         for index in occurences:             secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:]         print(secrete_word)     else:         user_input = input("Sorry that letter was not found, please try again: ")   def findOccurrences(s, ch):     return [i for i, letter in enumerate(s) if letter == ch]  *** enumerate not discussed in…

Find errors in this code also: internalstatdchkPalindrome(string str) { for(int i = 0, j = str.Length - 1; i < str.Length / 2; i++, j--) { if(str[i] != str[j]) { flag = false; break; } } if(flag) { ome"); } else Console.ine("Not Palindrome"); }

To declare an array of String called myStrings, we would code: ArrayList<Blank 1> myStrings = Blank 2 ArrayList<String>();

# Initialize sets A and BA = { 'a', 'b', 'c', 'd', 'e', 'f' }B = { 'c', 'd', 'f', 'h', 'j', 'k' } print('A = ', sorted(A))print('B = ',sorted(B))print(' ') AsymdiffB = set()# put your code here to compute the symmetric difference of A and B# first add all the elements that are in A but not B# then add all the elements that are in B but not A print('Symmetric Difference of A and B = ', sorted(AsymdiffB))