I have an array with names. Sometimes the same name can appear more than once. In C++ how do I write a function that prints the duplicates once?

In C: Create a program that allocates an array of integers frees them, and then tries to print the value of one of the array elements. Now, try to free a value that is not created by malloc (e.g., a pointer in the middle of the array you allocated above). What happens? Do you need gdb or valgrind to find this type of problem?

You’re writing a function that accepts an array of unsorted integers and returns the length of the longest consecutive sequence among them. The sequence is formed by integers that increase by 1. For example, in the array: [10, 5, 12, 3, 55, 30, 4, 11, 2] the longest consecutive sequence is 2-3-4-5. These four integers form an increasing sequence because each integer is one greater than the previous one. While there’s also a sequence of 10-11-12, it’s only a sequence of three integers. In this case, the function should return 4, since that’s the length of the longest consecutive sequence that can be formed from this array. One more example: [19, 13, 15, 12, 18, 14, 17, 11] This array’s longest sequence is 11-12-13-14-15, so the function would return 5. Your job is to optimize the function so that it takes O(N) time.

C++  Get a value from the user and using a loop, search for the value in the array. Report all the index locations where it is found Report if it is not found anywhere   This is part 4 of an ongoing assignment RandArray which consisted of assigning 20 integers with a random value. I am not sure how to write this out so it matches the output ( in the attached pictures ). I have attached the starter code to this problem as well as my code for part 3 which was correct. Thank you   ( STARTER CODE )    #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){// Put Part3 code here //Part 4// ask cout << "Enter value to find: ";// look through the array. // If it is found:// print // Found 55 at index 12 // if it is not found after looking at all the elements, // print // 0 is not found in randArray }       _______________________________________________________________________         ( PART 3 CODE )     #include <iostream> using…

Given a file of unsorted words with mixed case: read the entries in the file and sort those words lexicographically. The program (in c++) should then prompt the user for an index, and display the word at that index. Since you must store the entire list in an array, you will need to know the length. The "List of 1000 Mixed Case Words" contains 1000 words. You are guaranteed that the words in the array are unique, so you don't have to worry about the order of, say, "bat" and "Bat."

Question 20 What is another name for a headend satellite? TV Receive Only Dish Omni Directional Antenna Microwave Receiver Over the Air Antenna Tower Select the appropriate response Submit Response ✔

Write a modular program that accepts up to 20 integer test scores in the range of 0 to 100 from the user and stores them in an array. Then main should report how many perfect scores were entered (i.e., scores of 100), using a value-returning countPerfect function to help it.

C++ Write a function named “checkInvalidHours” that accepts an array of PaySubobjects and its size. It will go through the array and check for invalid hours(negative values). If it is negative, it will reset the hourly payrate to 0. It willreturn how many PayStub objects that it has reset the payrate to 0.Please show you would call and test this function.

Please use easy logic with proper indentations and comments for understanding!. Coding should be in C++. 3. Define a class which stores up to 10 integer values in an array.  The class should also define the following 4 public methods:       setNumber – accepts an integer value to store in the array.  The value is stored in the next available element of the array (first call to the method stores the value in element 0 with the second call storing the value in element 1.) The method returns true if there is room in the array and the integer was successfully stored.  Returns false otherwise.        clear – removes all values from the array so that the array can be reused.     displayNumbers – displays the values currently stored in the array.     getStats – determines the largest, smallest, and average of the values currently stored in the array.  These values are returned to the caller via reference parameters. All methods should produce correct results regardless of the order in which…

Revise the following Course class implementation in the following c++ code When adding a new student to the course, if the array capacity is exceeded, increase the array size by creating a new larger array and copying the contents of the current array to it. Implement the dropStudent function. Add a new function named clear() that removes all students from the course. Implement the destructor and copy constructor to perform a deep copy in the class. Write a test program that creates a course, adds three students, removes one, and displays the students in the course.