Computer Engineering In multiplication, assume that leading zeroes are not allowed. Write a program in C++ to help Prima that will find all solutions to this problem for any subset of digits from the set {1,2,3,4,5,6,7,8,9}. The input contains the number of digits that will be used and the second line contains the space separated digits. You have print the output with the total number of unique solutions. Sample Input1: 5 2 3 4 6 8 Output: 1

Apply your knowledge about arrays and functions and write a program, which takes a positive integer N from user, and prints the multiplication table of the size N by N. For Example, if the user enters 10 then your program should display the following table. Note: your program should have a function naming "Multiplication" which should take size N as input argument. Output should be in this format. 1 2 3 4 5 6 7 8 9 10 71 81 91 10 I 1 I 21 31 4 1 4 51 5 61 6 12 7 8 16 24 1 123 2 3 4 5 6 7 8 9 8 10 12 14 16 18 12 15 18 21 24 27 16 20 32 36 20 25 30 35 40 45 18 24 30 36 42 48 54 35 42 49 56 63 70 32 40 48 56 64 72 80 36 45 54 63 72 81 90 20 30 40 50 60 70 80 90 100 2 3 6 6 9 8 12 10 24 10 15 14 21 28 9 18 27 24 28 10 20 30 40 50 60

The twins Kartik and Kunaal want to play word search puzzles with their class. They want to befaster than everyone else in their class, so they decided to write a C code to help them find wordswith a click of a button. Little did they know, everyone in class decided to do this question.   You are required to implement search2D function.   void search2D(char word[], int wordSize, const int Size, char grid[Size][Size]);   search2D receives the word to look for char word[], the size of the word int wordSize, sizeof the grid const int Size and the puzzle grid char grid[Size][Size]. The word size can bebetween 2 and 23. You are NOT required to check for the validity of the word size.search2D should look for the first letter in the word row by row. If it finds the first letter of the wordin the puzzle, it should look for the remaining of the word in the 8 directions from the south and goesclockwise, i.e. south, south-west, west, north-west, north, north-east, east and lastly…

In python

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.

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."

in the C++ version please suppose to have a score corresponding with probabilities at the end and do not use the count[] function. Please explain the detail when coding. DO NOT USE ARRAY. The game of Pig The game of Pig is a dice game with simple rules: Two players race to reach 100 points. Each turn, a player repeatedly rolls a die until either a 1 ("pig") is rolled or the player holds and scores the sum of the rolls (i.e. the turn total). At any time during a player's turn, the player is faced with two decisions: roll - if the player rolls 1: the player scores nothing and it becomes the opponents turn. 2 - 6: the number is added to the player's turn total and the player's turn continues. hold - The turn total is added to the player's score and it becomes the opponent's turn. This game is a game of probability. Players can use their knowledge of probabilities to make an educated game decision.   Assignment specifications Hold-at-20 means that the player will choose to roll…

No hand written and fast answer with explanation

please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.

The following requirments that weren't mentioned for solving the following Python Code below: The provided code for alphabet, test_dups, test_miss, and histogram.  Your implementation of the has_duplicates function.  A loop that outputs duplicate information for each string in test_dups.  Your implementation of the missing_letters function.  A loop that outputs missing letters for each string in test_miss.  Write a function called missing_letters that takes a string parameter and returns a new string with all the letters of the alphabet that are not in the argument string. The letters in the returned string should be in alphabetical order.  Your implementation should use a histogram from the histogram function. It should also use the global variable alphabet. It should use this global variable directly, not through an argument or a local copy. It should loop over the letters in alphabet to determine which are missing from the input parameter.  The function missing_letters should…