#dynamic-programming

You have 2 identical eggs and a building with 100 floors. There is an unknown threshold floor such that an egg breaks when dropped from that floor or above and survives from any floor below, and an egg that survives can be reused. What is the smallest number of drops that guarantees finding the…

Given an array of $n$ integers, some possibly negative, find a contiguous subarray with the largest sum. For example, in $[-2,1,-3,4,-1,2,1,-5,4]$ the best subarray is $[4,-1,2,1]$ with sum 6. Give an $\mathcal{O}(n)$ algorithm and prove it correct.