PYTHON PROGRAMMING. Thank you!! Create another program that has the same functionally as palindrome (a) but hasthe fastest time complexity you can think of. Identify the time complexity you usedin your new program.def palindrome(a):def pal(a):if len(a) < 1:return [""]1 = []for i in range(len(a)):for j in pal(a[:i]+a[i+1:]):1. append(a[i]+j)return 1O = set()for q in pal(a):q[ ::-1]:o. add(q)if qreturn om = palindrome ( "mom")print(m)

Please refer beloe code and output: Language used is Python: Concept is to check each character from…

Create another program that has the same functionally as palindrome (a) but has the fastest time complexity you can think of. Identify the time complexity you usec in your new program. def palindrome(a): def pal(a): if len(a) < 1: return [""] 1 = [] for i in range(len(a)): for j in pal(a[:i]+a[i+1:]): 1. append(a[i]+j) return 1 O = set() for q in pal(a): if q q[ ::-1]: o.add(q) return o palindrome ("mom") print(m) m =

Create another program that has the same functionally as palindrome (a) but has the fastest time complexity you can think of. Identify the time complexity you usec in your new program. def palindrome(a): def pal(a): if len(a) < 1: return [""] 1 = [] for i in range(len(a)): for j in pal(a[:i]+a[i+1:]): 1. append(a[i]+j) return 1 O = set() for q in pal(a): if q q[ ::-1]: o.add(q) return o palindrome ("mom") print(m) m =

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one-word names, then use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia
Write an improved version of the chaos . py program from Chapter 1 thatallows a user to input two initial values and the number of iterations, and then prints a nicely formatted table showing how the values changeover time. For example, if the starting values were . 25 and . 26 with 10iterations, the table might look like this: index 0.25 0.26----------------------------1 0 . 731250 0 . 7503602 0 . 766441 0 . 7305473 0 . 698135 0 . 7677074 0 . 821896 0 . 6954995 0 . 570894 0 . 8259426 0 . 955399 0 . 5606717 0 . 166187 0 . 9606448 0 . 540418 0 . 1474479 0 . 968629 0 . 49025510 0.118509 0 . 974630
Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia -1 then the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia partial code below, only lines 9-11, and 18 can be added onto, the rest must stay the same. #include <vector>#include <string>#include <iostream> using namespace std; // TODO: Write method to create and output all permutations of the list of names.void AllPermutations(const vector<string> &permList, const vector<string> &nameList) { } int main(int argc, char* argv[]) { vector<string> nameList; vector<string> permList; string name; // TODO: Read in a list of names; stop…
Write a program that gets a list of integers from input, and outputs negative integers in descending order (highest to lowest). Ex: If the input is: 10 -7 4 -39 -6 12 -2 the output is: -2 -6 -7 -39 For coding simplicity, follow every output value by a space. Do not end with newline.
Write a program that gets a list of integers from input, and outputs non-negative integers in ascending order (lowest to highest). Ex: If the input is: 10 -7 4 39 -6 12 2 the output is: 2 4 10 12 39 For coding simplicity, follow every output value by a space. Do not end with newline. simple python
Implement the vacuum cleaning agent function in Python/Java for the scenario described below: Consider two-dimensional Boolean array of size m x n (m and n can each be equal to 4) where m is the number of rows, and n is the number of columns. Obtain numerical positive integer values for m and n as inputs from the user. Generate random numbers and scale them down to either a “0” or a “1” according to whether they represent “Clean” or “Dirty”, respectively. After filling the array with 0s or 1s, start at some random array position indicating the initial position of the vacuum cleaner. First check if at that current position, there is the presence of a “Dirt” or not determined by whether 0 or 1 is filled in at that initial position of the vacuum cleaner. If there is a “Dirt”, clean it, and if there is no “Dirt” do a No-operation. After this is done, generate random numbers modulo 4 to obtain random numbers 0, 1, 2, 3 indicating whether to take a left, right, up or down correspondingly. If…
Write a program in Python that first gets a list of integers from input. The input begins with an integer indicating the number of integers that follow. Then, get the last value from the input, which indicates a threshold. Output all integers less than or equal to that last threshold value. Ex: If the input is: 5 50 60 140 200 75 100 the output is: 50 60 75 The 5 indicates that there are five integers in the list, namely 50, 60, 140, 200, and 75. The 100 indicates that the program should output all integers less than or equal to 100, so the program outputs 50, 60, and 75.
Write a python program: In the first century AD, Nicomachus suggested in his book entitled Introduction Arithmetica that “Cubical numbers can always be represented as the sum of successive odd numbers.” For example, 1^3= 1 = 1 2^3 = 8 = 3 + 5 3^3 = 27 = 7 + 9 + 11 4^3 = 64 = 13 + 15 + 17 + 19 Input N and output the successive odd integers whose sum is i^3 for all i in the set { 1,2,..,N } .
Write regular expressions for the following languages. By “word”, we mean an alphabetic string separated from other words by whitespace, any relevant punctuation, line breaks, and so forth. (a) The set of all alphabetic strings;(b) The set of all lower case alphabetic strings ending with a letter b;(c) The set of all strings with two consecutive repeated words (e.g., “Humbert Humbert” and “the the” but not “the bug” or “the big bug”);(d) All strings that start at the beginning of the line with an integer and that end at the end of the line with a word;(e) All strings that have both the word grotto and the word raven in them (but not, e.g., words like grottos that merely contain the word grotto);
Write a program to build a calculator. Instead of a typical calculator which reads in-order expressions and evaluates them, build a calculator that takes in numbers and assigns the operations to yield the highest value expression. The current operations on the calculator only handle pairs of parentheses, and the operators for addition, subtraction, multiplication, and division. The calculator can rearrange the numbers if it helps find the optimal value. For example, the list:4.0 5.0 3.0 2.0 1.0using the calculator should find the optimal expression yielding the maximum value to be:4.0 * 5.0 * 3.0 * (2.0 + 1.0) = 180Input from the keyboard a list of up to 10 floating-point values from-100000.0to100000.0. Output to the screen a single floating-point value rounded to two decimal places representing the highest value expression that the calculator could create by inserting the symbols( ) + - * /into the given expression. Assume at least one number in the list and only the operators listed…
write a java program using stacks: 1. For a given expression in the form of a string, find if there exist any redundant brackets or not. It is given that the expression contains only rounded brackets or parenthesis and the input expression will always be balanced. A pair of the brackets is said to be redundant when a sub-expression is surrounded by unnecessary or needless brackets. Sample Input 1: (a+b)+c Sample Output 1: false Explanation: Since there are no needless brackets, hence, the output must be 'false'. Sample Input 2: ((a+b)) Sample Output 2: true Explanation” The expression can be reduced to (a+b). Hence the expression has redundant brackets and the output will be 'true'.
Write a program that first gets a list of integers from input. The input begins with an integer indicating the number of integers that follow. Then, get the last value from the input, which indicates a threshold. Output all integers less than or equal to that last threshold value. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 50 60 140 200 75 100 the output is: 50,60,75, The 5 indicates that there are five integers in the list, namely 50, 60, 140, 200, and 75. The 100 indicates that the program should output all integers less than or equal to 100, so the program outputs 50, 60, and 75. For coding simplicity, follow every output value by a comma, including the last one. Such functionality is common on sites like Amazon, where a user can filter results.