Given an array of integers nums, you start with an initial positive value startValue. In each iteration, you calculate the step by step sum of startValue plus elements in nums(from left to right). Return the minimum positive value of startValue such that the step by step is never less than 1.

Input: nums = [-3,2,-3,4,2]

Output: 5

def ifcond(x): if x>=1: return 1 else: return 0 nums=list(map(int,input('Enter an array of integers : ').split(' '))) for i in range(max(nums)+100): count=0 sum=0 for j in range(len(nums)): if j==0: sum+=i+nums[j] count+=ifcond(sum) else: sum+=nums[j] count+=ifcond(sum) if count == len(nums): count=i break if count==0: print(nums[0]) else: print(count)

Input_1:

Enter an array of integers : -3 2 -3 4 2

Output:

5

Input_2:

Enter an array of integers : 1 2

Output:

1

**Morae Q!**

- Convert Numbers into Roman Numerals
- Return the size of the longest sub-string
- Return all strings in words which is sub-string of another word in any order.
- Calculate the step by step sum of startValue plus elements in array.
- Find the minimum number of Fibonacci numbers whose sum is equal to k.
- Given a string s of zeros and ones, return the maximum score after splitting the string.
- Write a efficient functions to find floor of x.
- Print all numbers less than n which are having digits only 3 or 7 or both.
- Function that returns true if given array can be divided into pairs.
- Find the smallest element in the list that is larger than the given target.
- Print the First N prime numbers.
- The Chef’s Binary Tree.
- The minimum number of strikes he will have to make.(so that all his enemies have the same name)
- Sum of Natural Numbers.
- Sum of the Input.
- Find the Sum of the Series: 1 + 1/2 + 1/3 + .. + 1/N.
- Split elements into even and odd list
- Python Program to Merge Two Lists and Sort it.
- Median of Three.
- Find the Largest Number in a List.