Write a function that takes in a string as input and returns a list of the unique characters used in the string. Punctuation should not be counted as a unique character. For our purposes you may consider the following characters as punctuation: .,; :?!"'- Your list should return all letters as lower case and sorted. So for example if the input is ' (Happy days are here again!"your function should return the list ['a', 'd','e','g','h','i','n', 'p','r','s','y']

Write a function that takes in a string as input and returns a list of the unique characters used in the string. Punctuation should not be counted as a unique character. For our purposes you may consider the following characters as punctuation: .,; :?!"'- Your list should return all letters as lower case and sorted. So for example if the input is ' (Happy days are here again!"your function should return the list ['a', 'd','e','g','h','i','n', 'p','r','s','y']

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a function that takes a string as its only argument and returns a sorted list of characters used in the string. The resulting list should only contain lower case letters and each letter should exist only once. Also, the resulting list shouldn't contain any spaces or punctuation marks, such as ",;.!?". For example, strLetters("We are, the Champions!") returns ['a', 'c', 'e', 'h', 'i', 'm', 'n', 'o', 'p', 'r', 's', 't', 'w'] In pyhton format
Write a function that takes a string as its only argument and returns a sorted list of characters used in the string. The resulting list should only contain lower case letters and each letter should exist only once. Also, the resulting list shouldn't contain any spaces or punctuation marks, such as ",;.!?". For example, strLetters("We are, the Champions!") returns ['a', 'c', 'e', 'h', 'i', 'm', 'n', 'o', 'p', 'r', 's', 't', 'w'] in pyhton
Write a function that takes a string as its only argument and returns a sorted list of characters used in the string. The resulting list should only contain lower case letters and each letter should exist only once. Also, the resulting list shouldn't contain any spaces or punctuation marks, such as ",;.!?". For example, strLetters("We are, the Champions!") returns ['a', 'c', 'e', 'h', 'i', 'm', 'n', 'o', 'p', 'r', 's', 't', 'w']
Note: I need this in Drracket(racket). Write a function that takes a list containing characters and numbers as input (in random orders) and displays as output a string containing the character and a list containing the numbers, e.g., given the lists ‘("h" 1 2 3 "e" "l" 4 5 "l" "o"), your method should output: "hello" and '(1 2 3 4 5 6). Please make sure to test your function and to explain how your code works.
in F# (F sharp) Write an function findMatches that takes a string and a list of tuples as arguments. Each element of the list will be a tuple consisting of a string and an int. Find all of the tuples for which the string matches the first argument and collect all of the corresponding integers. Your final result should be the collected integers sorted in ascending order. For example, if the string argument is "A" and the list is [("A",5); ("BB",6); ("AA",9); ("A",0)], your function should return the list [0;5]. You may use the List.sort function to produce your final result.
In F# (F sharp) Write an function findMatches that takes a string and a list of tuples as arguments. Each element of the list will be a tuple consisting of a string and an int. Find all of the tuples for which the string matches the first argument and collect all of the corresponding integers. Your final result should be the collected integers sorted in ascending order. For example, if the string argument is "A" and the list is [("A",5); ("BB",6); ("AA",9); ("A",0)], your function should return the list [0;5]. You may use the List.sort function to produce your final result. Important: Do not use F# system functions or methods (such as map, max or filter, etc). Examples in F# Interactive: > findMatches "A" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = [0; 5]> findMatches "BB" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = [6]> findMatches "X" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = []> findMatches "A" [];;val it : int list = []…
this code should be in 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 [“dog”, “cat”, “car”, “level”, “dad”], the returned value should be “level”. Note that “dad” is also a palindrome, but it is not the first one.
Write a function that takes a string as its only argument and returns a sortedlist of characters used in the string. The resulting list should only containlower case letters and each letter should exist only once. Also, the resultinglist shouldn't contain any spaces or punctuation marks, such as ",;.!?". For example, strLetters("We are, the Champions!") returns['a', 'c', 'e', 'h', 'i', 'm', 'n', 'o', 'p', 'r', 's', 't', 'w']""" def strLetters(iStr):return # Remove this line to answer this question.
Write a function that will accept a list of numbers and an integer (n). Thefunction should return a list containing every nth item from the input list,always starting with the first item in the list. The original list should notbe modified.For example, if the function is passed the list[8, 3, 19, 26, 32, 12, 3, 7, 21, 16]and the integer 3, it will return the list[8, 26, 3, 16]The function should be general, and work for any list and any positiveinteger value of n.def countByN(myList,n):return myList[::n]
Write a function that takes two arguments, a list L1 and a list L2. • If the length of the list L1 is greater than twice the length of the list L2, then append the first three values of L1 to the three last values of L2. E.g. if L1 = ‘(1 2 3 4 5 6 7) and L2 = ‘(8 9 10), then return ‘(1 2 3 8 9 10) Should be written in the Racket programming language
Use Standard ML Code: Write a function that returns the factorial of a number. Write a function that sums all numbers in a list of pairs. e.g.: sum_of_pairs [(1, 2), (4, 3), (2, 5)] should return 17 (which is equal to 1 + 2 + 4 + 3 + 2 + 5) Write a function to return a list of second elements in a list of pairs. e.g.: sends [(1, 2), (4, 3), (2, 5)] should return [2, 3, 5]।
Write a function called `filler(A, l)` that takes an integer `A`, and a list of integers `l` and if some of the numbers in `l` sum up to `A` then it returns a list of these numbers. Otherwise, it returns `None`. For example, filler(5, [1,6,3,4]) returns [1,4]. filler(5, [1,6,3,7]) returns None. filler(0, [-1,-1,2,-3]) returns [-1,-1,2]. filler(10, [2,3,2,3,1]) returns [2,3,2,3]. If there are multiple answers, then return any of them. You can use each number in the list once for each occurence. """ def filler(A, l): # remove the following line to solve this question return