Complete the implementation of an autocorrect function. Given a search query string, the functionshould return all words which are anagrams.Given 2 arrays, words[n], and queries[q], for each query, return an array of the strings that areanagrams, sorted alphabetically ascending.Note: An anagram is any string that can be formed by rearranging the letters of a string.Examplen = 4, q=2words = ["duel", "speed", "dule", "cars"],queries=["spede", "deul"].The only anagram of "spede" is "speed".Both "duel" and "dule" are anagrams of "deul".Return [["speed"], ["duel", "dule"]].Function DescriptionComplete the function getSearchResults in the editor below.getSearchResults takes the following arguments:string words[n]: the list of words to searchstring queries[q]: the words to search forReturnsstring[q]: the results for each search queryConstraints• 1 ≤n, q≤ 5000• 1 s length of words[i], length of queries[i] ≤ 100• It is guaranteed that each query word has at least one anagram in the words list.▼ Input Format For Custom TestingThe first line contains an integer, n, the number of elements in words.Each of the next n lines contains a string, words[i].The next line contains an integer, q, the number of elements in queries.Each of the next n lines contains a string, queries[i].▾ Sample Case 0Sample Input For Custom TestingSTDIN6allot →catpeachdustyactcheap3tacstudypeahcSample Outputact catdustycheap peachExplanationSTDIN5emitsitemsbakertimesbreak2FUNCTIONThe anagrams of "tac" in alphabetical order are "act" and "cat". The only anagram of "study" is"dusty". The anagrams of "peahc" are "cheap" and "peach".mitesbrake‒‒‒‒‒‒‒‒▾ Sample Case 1Sample Input For Custom TestingFUNCTIONwords [] size n = 6words = ["allot", "cat", "peach", "dusty", "act", "cheap"]→queries] size q 3queries= ["tac", "study", "peahc"]→words [] size n = 5→ words = ["emits", "items", "baker", "times", "break"]queries] size q = 2queries = ["mites", "brake"]Sample Outputemits items times.baker breakExplanationThe anagrams of "mites" are "emits", "items", and "times". The anagrams of "brake" are "baker" and"break". Language C++201 ✓ #include 23 using namespace std;4string ltrim(const string &);string rtrim(const string &);✪ Environment5678910111213141516171819 vector> getSearchResults(vector words, vector queries) {20212223242526272829/** Complete the 'getSearch Results' function below.*}* The function is expected to return a 2D_STRING_ARRAY.* The function accepts following parameters:★ 1. STRING ARRAY words★ 2. STRING_ARRAY queries*/int main(){ofstream fout (getenv ("OUTPUT_PATH"));Autocomplete Readystring words_count_temp;getline (cin, words_count_temp);

In this question we have to write a C++ code for the implementation of an autocorrect function.…

Complete the implementation of an autocorrect function. Given a search query string, the function should return all words which are anagrams. Given 2 arrays, words[n], and queries[q], for each query, return an array of the strings that are anagrams, sorted alphabetically ascending. Note: An anagram is any string that can be formed by rearranging the letters of a string. Example n=4, q=2 words = ["duel", "speed", "dule", "cars"], queries = ["spede","deul"). The only anagram of "spede" is "speed". Both "duel" and "dule" are anagrams of "deul". Return [["speed"], ["duel", "dule"]]. Function Description Complete the function getSearchResults in the editor below. getSearch Results takes the following arguments: string words[n]: the list of words to search string queries[q]: the words to search for Returns string[q][]: the results for each search query Constraints 1 ≤ n, q ≤ 5000 • 1 s length of words[i], length of queries[i] ≤ 100 • It is guaranteed that each query word has at least one anagram in the words list.

Complete the implementation of an autocorrect function. Given a search query string, the function should return all words which are anagrams. Given 2 arrays, words[n], and queries[q], for each query, return an array of the strings that are anagrams, sorted alphabetically ascending. Note: An anagram is any string that can be formed by rearranging the letters of a string. Example n=4, q=2 words = ["duel", "speed", "dule", "cars"], queries = ["spede","deul"). The only anagram of "spede" is "speed". Both "duel" and "dule" are anagrams of "deul". Return [["speed"], ["duel", "dule"]]. Function Description Complete the function getSearchResults in the editor below. getSearch Results takes the following arguments: string words[n]: the list of words to search string queries[q]: the words to search for Returns string[q][]: the results for each search query Constraints 1 ≤ n, q ≤ 5000 • 1 s length of words[i], length of queries[i] ≤ 100 • It is guaranteed that each query word has at least one anagram in the words list.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Write pseudocode for a function Det-Quicksort(A, p, r) that receives array A[1..n], and indices p and r. The function should sort the subarray A[p..r] recursively (meaning you should call itself). You can also use a function LinearSearch(A, p, r, v) that searches subarray A[p..r] for an element of value v and return its index (in case it exists) in O(r − p) time. (Just to give you something to compare to, the solution has 8 lines.)
Implement the following function, without using any data structure. /* Given two vectors of chars, check if the two vectors are permutations of each other, i.e., they contains same values, in same or different order.e.g., V1=[‘a’,’b’,’a’] and V2=[‘b’,’a’,’a’] stores same multi-set of data points: i.e., both contains two ‘a’, and one ‘b’. e.g., V3=[‘a’,’c’,’t’,’a’] and V4=[‘a’,’c’,’t’] are not same multi-set. V3 contains two ‘a’s, while V4 has only one ‘a’. Note: when considering multiset, the number of occurrences matters. @param list1, list2: two vectors of chars @pre: list1, list2 have been initialized @post: return true if list1 and list2 stores same values (in same or different order); return false, if not. */  bool SameMultiSet (vector<char> list1, vector<char> list2)
Given the following function, what happens if a[] contains just one element that doesn't match val? int binarySearch(int a[], int first, int last, int val){ if (first > last) return -1; int middle = (first + last) / 2; if (a[middle] == val) return middle; if (a[middle] < val) return binarySearch(a, middle+1, last, val); else return binarySearch(a, first, middle-1, val);} Group of answer choices binarySearch never calls itself again and terminates (recursion never happens) binarySearch calls itself once then terminates (recursion happens once) binarySearch calls itself twice then terminates (recursion happens twice) binarySearch calls itself 3 times then terminates (recursion happens 3 times)
Finally, we will do some simple analysis – ranking of words. Write a function word_ranking(corpus, n, sort_index) which takes input parameters corpus (type list), n (type int), and sort_index (type int) and returns a list containing tuples of words and their frequencies in the top n of words. Here, corpus is a list of sentences. n is the number of ranked words to return. The resulting list should then be sorted based on the sort_index; sort_index = 0 should sort the list of tuples in ascending alphabetical order, while sort_index = 1 should sort the list of tuples by the frequencies in descending order. All other numeric values for sort_index should return an empty list (don't need to consider non-integer inputs). For example, we have: corpus = ['hi hi hi hi', 'hello hello say bye', 'bye bye']n = 3sort_index = 1 The function should return: [('hi', 4), ('bye', 3), ('hello', 2)] While sort_index = 0 should return: [('bye', 3), ('hello', 2), ('hi', 4)] You can assume n would…
Write a function that gets an array of points and sorts the array using qsort(). Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)½ is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation: (1,1) is first because 12+12=2 is the smallest (3,2) is next because 32+22 = 13 is the second smallest Both (3,4) and (5,0) have the same sum of squares, 25, but 3<5 so…
solve in C please. Implement the following two functions that get a string, and compute an array of non-emptytokens of the string containing only lower-case letters. For example:● For a string "abc EFaG hi", the list of tokens with only lower-case letters is ["abc", "hi"].● For a string "ab 12 ef hi ", the list of such tokens is ["ab","ef","hi"].● For a string "abc 12EFG hi ", the list of such tokens is ["abc","hi"].● For a string " abc ", the list of such tokens is ["abc"].● For a string "+*abc!! B" the list of such tokens is empty.That is, we break the string using the spaces as delimiters (ascii value 32), and look only at thetokens with lower-case letters only .1. The function count_tokens gets a string str, and returns the number ofsuch tokens.int count_tokens(const char* str);For example● count_tokens("abc EFaG hi") needs to return 2.● count_tokens("ab 12 ef hi") needs to return 3.● count_tokens("ab12ef+") needs to return 0.2. The function get_tokens gets a string str, and…
Write a function that gets an array of ints of length n, and a number k, and returns the longest subsequence of consecutive k’s in the array. For example - On input ([1, 1, 3, 3, 3, 1, 5, 1], 1), the function returns 3 - On input ([1, 3, 3, 2, 3, 3, 3, 3], 3), the function returns 4 - On input ([3, 5, 2, 5, 2, 5, 5], 3), the function returns 2 - On input ([1, 2, 3, 3, 3, 3], 5), the function returns 0 // returns the length of the longest subsequence // of consecutive k’s in the array int longest_seq(const int* ar, int n, int k); test for the function: void test_q1() { inta1[] = {1, 1, 3, 3, 3, 1, 5, 1}; if (longest_seq(a1, 8, 1) == 2) printf("Q1-1 ok\n"); else printf("Q1-1 ERROR\n"); inta2[] = {1,3,3,2,3,3,3,3}; if (longest_seq(a2, 8, 3) == 4) printf("Q1-2 ok\n"); else printf("Q1-2 ERROR\n"); }
Implement substringList() that will produce the collection of words from the 1D array B that has substrings equivalent to the string key. The resulting collection should be stored in array C and this should contain only the unique set of words. The function returns the resulting total number of elements in array C. For your reference, a substring is a contiguous sequence of characters within a string. As an example, the strings “app”, “ppl”, “apple”, and “e” are among the substrings from the string “apple”. But, strings “ale” are “elppa” are not substrings from string “apple”. key = "or" array B = {"it's", "today", "now", "or", "forever", "today", "ACT"} array C should be {"or", "forever"} Rules: You can only use strcmp, strcat, and strcpy Maximize the use of loops (e.g., for) you can create local variables that can aid you
A set of integers 0..MAX may be implemented using an array of boolean values. This particular implementation is called a bit-vector implementation of a Set. Since C doesn’t have the Boolean data type, then substitute TRUE with 1 and FALSE with 0, or define 1 and 0 as TRUE and FALSE, respectively.For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE. For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE.For example: if s = {3,4,6,8}, the array looks like this: Implement a programmer-defined data type called BitSet to represent a set as follows:typedef int BitSet[MAX];Implement the following functions:void initialize(BitSet s); - set all array elements to FALSEvoid add(int elem,BitSet s);- set the item indexed by elem to…
Write a function/ program that produces the following: int findDifference(const string a1[], int n1, const string a2[], int n2); Return the position of the first corresponding elements of a1 and a2 that are not equal. n1 is the number of interesting elements in a1, and n2 is the number of interesting elements in a2. If the arrays are equal up to the point where one or both runs out, return the smaller of n1 and n2. Notwithstanding each function's behavior described below, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array. Here's an example: string cast[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; string roles[4] = { "samwell",…
Implement a range function for a dynamic array which returns a new dynamic array that is a subset of the original. input parameters: array - (the array and any related parameters) start - index of the first elementend - index of the last elementInterval - An integer number specifying the incrementation of index This function returns a new dynamic array containing the elements from the start thru the end indices of the original array.All array indexing must be done using pointer arithmetic. For example, given the array: 49 96 99 47 76 29 22 16 30 22 If the start and end positions were 5 and 9 with step 2, return a new dynamic array: 29 16 22 Please use following main to test your function. int main(){int *p = new int[10]{49,96,99,47,76,29,22,16,30,22}; int *q = range(p,10,5,9,2);for(int i=0;i<3;i++) cout<<q[i]<<" "; // print 29 16 22 cout<<endl;delete [] q;q = range(p,10,1,8,3); for(int i=0;i<3;i++)cout<<q[i]<<" "; // print 96 76 16 cout<<endl;…
Write programs with these input and output Given positive integers m and n, find the number of ontofunctions from a set with m elements to a set with n elements.