you must include a while loop in this functionyou should not us any of the following:dictionaries or dictionary methodstry-exceptbreak and continue statementsrecursionmap / filter LAB RESTRICTIONS, PLEASE READ:Do not add any imports, the ones that you need will be given to you.You may not use any dictionaries or dictionary methods.Do not use try-except statements, you should be able to anticipateor prevent any errors from happening at all!from typing import Any, List def longest_chain(lst: List[int]) -> int:II II IIGiven a list of integers, return the length of the longest chain of 1'sthat start from the beginning.You MUST use a while loop for this, and are not allowed to use a for loop.Hint: A good way to start is to define a stopping condition, and have avariable that keeps track of how many 1's you've seen thus far, if any.Precondition: will only contain the integers 1 and 0.>>> longest_chain([1, 1, 0])2>>> Longest_chain([0, 1, 1])>>> longest_chain([1, 0, 1, 1])1pass

Please refer to the following steps for the complete solution to the problem above.

def longest_chain (lst: List[int]) -> int: Given a list of integers, return the length of the longest chain of 1's that start from the beginning. You MUST Use a while loop for this, and are not allowed to use a for loop.

def longest_chain (lst: List[int]) -> int: Given a list of integers, return the length of the longest chain of 1's that start from the beginning. You MUST Use a while loop for this, and are not allowed to use a for loop.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 16PE

See similar textbooks

Similar questions

python help Q7: No Repeats Implement no-repeats, which takes a list of numbers s as input and returns a list that has all of the unique elements of s in the order that they first appear, but no repeats. For example, (no-repeats (list 5 4 5 4 2 2)) evaluates to (5 4 2). Hints: To test if two numbers are equal, use the = procedure. To test if two numbers are not equal, use the not procedure in combination with =. You may find it helpful to use the filter procedure. (define (no-repeats s) 'YOUR-CODE-HERE ) ;;; Tests (no-repeats (list 5 4 5 4 2 2)) ; expect (5 4 2) Q8: Substitute Write a procedure substitute that takes three arguments: a list s, an old word, and a new word. It returns a list with the elements of s, but with every occurrence of old replaced by new, even within sub-lists. Hint: The built-in pair? predicate returns True if its argument is a cons pair. Hint: The = operator will only let you compare numbers, but using equal? or eq? will let you compare symbols as…
def removeMultiples(x, arr) - directly remove the multiples of prime numbers (instead of just marking them) by creating a helper function. This recursive function takes in a number, n, and a list and returns a list that doesn’t contain the multiples of n.def createList(n) - a recursive function, createList(), that takes in the user input n and returns an array of integers from 2 through n (i.e. [2, 3, 4, …, n]). def Sieve_of_Eratosthenes(list) - a recursive function that takes in a list and returns a list of prime numbers from the input list.Template below: def createList(n): #Base Case/s #ToDo: Add conditions here for base case/s #if <condition> : #return <value> #Recursive Case/s #ToDo: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once all ToDo is completed return [] def removeMultiples(x, arr): #Base Case/s #TODO: Add conditions here for your…
def count_types(lst: List[Any]) -> List[int]: """ Given a list <lst> of random types, return the number of occurrences of each type, in the form of a list, in the order that they were first seen. For example, if the input ['str1', 1, 'str2'], the output would be [2, 1], as a string type appears first, and occurs twice in the list. An integer type appears next, and only occurs once in the list. Another example could be [True, 'str1', 1, False, 'str2', True], where the output would be [3, 2, 1], as a boolean type appears first, and occurs three times in the list. A string appears next, and occurs twice in the list. Finally, an integer appears next, and occurs once in the list. """don't use any import, dictionaries, or dictionary methods or try-except statements.
scheme: Q7: No Repeats Implement no-repeats, which takes a list of numbers s as input and returns a list that has all of the unique elements of s in the order that they first appear, but no repeats. For example, (no-repeats (list 5 4 5 4 2 2)) evaluates to (5 4 2). Hints: To test if two numbers are equal, use the = procedure. To test if two numbers are not equal, use the not procedure in combination with =. You may find it helpful to use the filter procedure. (define (no-repeats s) 'YOUR-CODE-HERE ) ;;; Tests (no-repeats (list 5 4 5 4 2 2)) ; expect (5 4 2)
def get_legal_word_scores(letters, dictionary, value_dict): """ Given a str of letters that we can use, and a dictionary that contains all legal words allowed in scrabble game, and a value_dict that maps each letter to a score, Returns a dictionary that contains all possible scores earned by any legal word as the key, and for each score, the score/key maps to a list of words that are from the dictionary made from the given letters and computes to that score. The list should be in alphabetical order. """
Implement a list of employees using a dynamic array of strings.Your solution should include functions for printing list, inserting and removingemployees, and sorting lists (use Bubble sort in C++ language).Keep list of employees sorted within the list after insertion.See the following example:How many employees do you expect to have?5 (Carriage Return)Menu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit2 (Carriage Return)Input name of new employee : MikeMenu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit1(Carriage Return)1 . MaryMenu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit
Implements clone which duplicates a list. Pay attention, because if there are sublists, they must be duplicated as well. Understand the implementation of the following function, which recursively displays the ids of each node in a list Develop your solution as follows: First copy the nodes of the current list (self) Create a new list with the copied nodes Loop through the nodes of the new list checking the value field If this field is also a list (use isinstance as in the show_ids function) then it calls clone on that list and substitutes the value. Complete the code: def L4(*args,**kwargs): class L4_class(L): def clone(self): def clone_node(node): return <... YOUR CODE HERE ...> r = <... YOUR CODE HERE...> return r return L4_class(*args,**kwargs)
) Write list comprehensions to generate the following:i) If numlist contains a list of numbers, create a new list that contains only thosenumbers that are less than 100. (e.g. [42, 130, 7, 100, 101] becomes [42, 7])ii) The numbers from 3 to 30 that are multiples of 3 (i.e. 3, 6, 9, 12, 15... 30)iii) The numbers from 3 to 30 that are multiples of both 3 and 2 (i.e. 6, 12, 18...)iv) If wordlist contains a list of strings, create a new list that has the words that startwith “p” or “P”. (e.g. [“Apple”, “pear”, “avocado”, “Pumpkin”] becomes[“pear”,”Pumpkin”] )
1- Start by writing your choice from the list given above. Part a. Explain the important technical details about your choice. 2-(continued) Start by again writing your choice from the list given above. Part b. Most of the ADTs in this class were implemented using arrays and linked lists. If appropriate for the ADT you chose in part a., explain which one (an array or a linked list) you would choose to implement it and why. If it doesn’t make sense to implement your ADT using an array or a linked list, explain which other data structure you would use to implement your ADT.
Exact change only def give_change(amount, coins): Given the amount of money (expressed as an integer as the total number of kopecks of Poldavia, Ruritania, Montenegro or some other such vaguely Eastern European 0ictional country that Tintin and similar fellows would visit) and the list of available denominations of coins (similarly expressed as kopecks), create and return a list of coins that add up to the amount using the greedy approach where you use as many of the highest denomination coins when possible before moving on to the next lower denomination. The list of coin denominations is guaranteed to be given in descending sorted order, as should your returned result also be. amount coins Expected result 64 [50, 25, 10, 5, 1] [50, 10, 1, 1, 1, 1] 123 [100, 25, 10, 5, 1] [100, 10, 10, 1, 1, 1] 100 [42, 17, 11, 6, 1] [42, 42, 11, 1, 1, 1, 1, 1] This problem, along with its countless variations, is a computer…
5.23 LAB: Swap ends (JAVA) Write a program in java that reads a list of integers from input and outputs the list with the first and last numbers swapped. The input begins with an integer indicating the number of values that follow. Assume the list contains fewer than 20 integers. Ex: If the input is: 8 1 2 3 4 5 6 7 8 the output is: 8 2 3 4 5 6 7 1 For coding simplicity, follow every output value by a space, including the last one. The output ends with a newline. Code starts here: import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int[] userValues = new int[20]; // List of integers from input /* Type your code here. */ }}
If the numbers are odd, the median is defined as the middle number after sorting them in order. If the number is even, it is the average of the middle two numbers. You begin with a blank number list. Then you may add new numbers to the list or remove existing ones. Output the median after each add or delete action. Example:The third value in the sorted list, which is, is the median for the given collection of integers. Similar to this, the median of a collection of numbers is equal to the average of the second and third element in the sorted set, or. Input:The first line of the input contains an integer, "," which represents the number of operations. The following lines are all either an x or r x. A x denotes an addition to the set, while a r x denotes a removal from the set. Output:For every action: If the operation is an addition, output the median on a single line following the addition. Output Wrong! on a single line if the operation is remove and the number is not in the list.…