Write a function filter_codes(list_codes) that receives a list of codes and returns another list containing those codes that: Only have numeric characters; and Are at least 2 characters long; and At most 6 characters long Hint: remember that Python has a built-in function for determining if a string only contains numeric characters. solve using python

Write a function filter_codes(list_codes) that receives a list of codes and returns another list containing those codes that: Only have numeric characters; and Are at least 2 characters long; and At most 6 characters long Hint: remember that Python has a built-in function for determining if a string only contains numeric characters. solve using python

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

INSTRUCTIONS: Write a Python script/code to do the given problems. EMOTIFY PROBLEM: Create a function that takes a string and returns a string with its letters in alphabetical order. Example: alphabet_soup(“hello") - ehllo alphabet_soup(“hacker") – acehkr
In Python Use the Design Recipe to write a function bools_2_str, which consumes a list of booleans and returns a string of the same length as the list. Where the list has True, the string should have 'X', and where the list has False, the string should have ' ' (i.e., a single space).
please code in python:def best(len_score,lst): max1=0 for i in reversed(lst): temp = len_score(i) if temp >= max1: max1 = temp ans = i return ans The best function should be able to take any scoring function and return the result. Define a function, number_of_vowels, that returns the number of vowels in a string. Pass it to your best function to find the name in names with the most vowels. See how easy it is to change the score function for different functionalities! Example: names = ["Ben", "April", "Zaber", "Alexis", "McJagger", "J.J.", "Madonna"] best(number_of_vowels, names) -> 'Alexis'
In C language, implement the function that gets a string str, changes all digits of str to 0 (zero), and returns the number of digits in the string. int digits_to_zero (char* str); For example: If str is "12ab0", then the function should change it to "00ab0", and return 3. If str is "abcde", then the function should keep it as is, and return 0. [Hint 1: you can check if a char is a digit using its numerical value. The numerical values of the digits are consecutive. For example, we have '3' + 2 =='5'] [Hint 2: you can also use the function isdigit (char c) implemented in the library <ctype.h> https://www.programiz.com/c-programming/library-function/ctype.h/isdigit]
Scrabble Scrabble is a game where players get points by spelling words. Words are scored by adding together the point values of each individual letter. Define a function scrabble_score (word:str) -> int that takes a string word as input and returns the equivalent scrabble score for that word. score = {"a": 1, "c": 3, "f": 4, "i": 1, "1": 1, "o": 1, "r": 1, "u": 1, "t": 1, "x": 8, "z": 10} For example, "b": 3, "h": 4, "n": 1, Your Answer: == 20 assert scrabble_score("quick") assert scrabble_score("code") == 7 1 # Put your answer here 2 Submit "e": 1, "d": 2, "g": 2, "k": 5, "j": 8, "m": 3, "q": 10, "p": 3, "s": 1, "w": 4, "v": 4, "y": 4,
Assume that L is a list of Boolean values, True and False. Write a program in python with a function longestFalse(L) which returns a tuple (start, end) representing the start and end indices of the longest run of False values in L. If there is a tie, then return the first such run. For example, if L is False False True False False False False True True False False 0 1 2 3 4 5 6 7 8 9 10 then the function would return (3, 6), since the longest run of False is from 3 to 6.
Python The function f(s,ch) gets a strings and a character ch. Then it returns a string that is similar to s but does NOT have the character ch. If ch does not appear in s then the result string is equal to s. Example: f('abacadaeafaga', 'a')=='bcdefg' f('abacadaeafaga', 'A')=='abacadaeafaga' Complete the following code for the function f : def f(s, ch): return
Help with a lisp function (please post photos) A lisp function that generates a random day of the week, then displays a message saying that "Today is ... and tomorrow will be ...". For this purpose, create a global variable before the function containing the days of the week as a list. Then use the built-in function random first to generate a number between 0 and 6 (including). The expression (random) by itself generates a random integer. You can call it with one parameter to return a value within the range from 0 to the value of the parameter-1. For example, (random 10) will return a value between 0 and 9. Next, use the number generated at the previous step to retrieve the symbol for the day of the week from the list. Use the built-in elt function. We want the name of the day to appear capitalized. For this, extract the symbol-name of the day first, then apply the built-in function capitalize to it. Use the result in the princ function call, and do the same thing for the next day.…
code should be python: write a function that allows the input of a list of strings as its only parameter. Inside the body of the function find the first palindromic word and return it. If there is no such word, it should return an empty string. A string is palindromic if it reads the same forward and backward so for example If we call the function with [“horse”, “rat”, “roar”, “dad”, “mom”], the returned value should be “dad”. Note that “mom” is also a palindrome, but it is not the first one.
Maximum Length Common Suffix Problem is defined as follows: Input: a list of L of n strings over the lowercase English alphabet of various lengths, maximum 10 characters Output: the longest common suffix among all the strings, or if they do not have a common suffix. A suffix is a list of characters attached at the end of a word; for example, the word "letter" has as suffixes the empty string, the word itself, and "r", "er", "ter", "tter", and "etter". Design a divide-and-conquer algorithm for it similar to merge sort algorithm and write a pseudocode for it. If you write multiple drafts, mark clearly your final draft. Hint: I expect your algorithm's time complexity ends up being O(n log n). For your convenience, the seudocode of decrease-by-half is given below. Examples: Input: n=4, L ={ "salty", "beauty", "meaty", "beatty") Output:"ty" Input: n=8, L-{"lot", "plot", "bylot", "dulot", "camelot", "effilot", "hairlot", "lelot"} Output="lot" Input: n=9, L={"lol", "tutu", "aba", "ddr",…
Write a Boolean function called contains_whitespace() that accepts a string as a parameter and returns True if the string contains one or more whitespaces (" ", "/t", "/n") characters, or False otherwise. Write a main() function to demonstrate how it works. In python
In Python Write and test a function to meet this specification. squareEach(nums) nums is a list of numbers. Modifies the list by squaring each entry. Should return the list of squared entries