5 Programming Problems That Can Be Fixed In An Hour 

Programming Problems

CRB Tech reviews the following issues are extremely easy, but you'd be amazed to find how many individuals battle with them. To the factor of not getting anything done at all. Seriously.

Problem 1

Write three features that estimate the sum of the figures in a given record using a for-loop, a while-loop, and recursion.

Problem 2

Write a function that brings together two details by alternatingly getting components. For example: given the two details [a, b, c] and [1, 2, 3], the function should come back [a, 1, b, 2, c, 3].

Problem 3

Write a function that determines the record of the first 100 Fibonacci figures. By meaning, the first two figures in the Fibonacci series are 0 and 1, and each following variety is the sum of the past two. As an example, here are the first 10 Fibonnaci numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, and 34.

Problem 4

Write a function that given a record of non adverse integers, sets up them such that they type the biggest possible variety. For example, given [50, 2, 1, 9], the biggest established variety is 95021.

Problem 5

Write a system that results all opportunities to put + or - or nothing between the figures 1, 2, ..., 9 (in this order) such that the outcome is always 100. For example: 1 + 2 + 34 – 5 + 67 – 8 + 9 = 100.

Unfortunately, you are not the one that needs this

If you hassle to study this weblog at all (or any other weblog about application development), you are probably excellent enough to fix these and 5 more issues within the time. The individuals that think are above all these "nonsense" are usually the ones that can't system code junk.

Write a comment

Comments: 0