Five Programming Problems

Problem One [12 Minutes]

Write three functions that compute the sum of the numbers in a given list using a for-loop, a while-loop, and recursion.

• List: {{ac.problemOneList}}
• Sum For: {{ac.sumFor}}
• Sum While: {{ac.sumWhile}}
• Sum Recursive: {{ac.sumRecursive}}

Problem Two [18 minutes]

Write a function that combines two lists by alternatingly taking elements. For example: given the two lists [a, b, c] and [1, 2, 3], the function should return [a, 1, b, 2, c, 3].

• List One: {{ac.problemTwoListOne}}
• List Two: {{ac.problemTwoListTwo}}
• Combine One: {{ac.problemTwoCombineOne}}
• Combine Two: {{ac.problemTwoCombineTwo}}

Problem Three [12 minutes]

Write a function that computes the list of the first 100 Fibonacci numbers. By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. As an example, here are the first 10 Fibonnaci numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, and 34.

• First 100 Fibonacci: {{ac.fibonacci}}

Problem Four [20 minutes]

Write a function that given a list of non negative integers, arranges them such that they form the largest possible number. For example, given [50, 2, 1, 9], the largest formed number is 95021.

• List: {{ac.nonNegatives}}
• Largest Formed: {{ac.largestFormed}}

Problem Five

Write a program that outputs all possibilities to put + or - or nothing between the numbers 1, 2, ..., 9 (in this order) such that the result is always 100. For example: 1 + 2 + 34 – 5 + 67 – 8 + 9 = 100.