working commit - Created using LeetHub

Author: JanaSabuj

best-time-to-buy-and-sell-stock-ii/README.md

@@ -0,0 +1,37 @@
+<h2>unknown-problem</h2><h3>Easy</h3><hr><div><p>Say you have an array <code>prices</code> for which the <em>i</em><sup>th</sup> element is the price of a given stock on day <em>i</em>.</p>
+
+<p>Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).</p>
+
+<p><strong>Note:</strong> You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).</p>
+
+<p><strong>Example 1:</strong></p>
+
+<pre><strong>Input:</strong> [7,1,5,3,6,4]
+<strong>Output:</strong> 7
+<strong>Explanation:</strong> Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
+&nbsp;            Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre><strong>Input:</strong> [1,2,3,4,5]
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
+&nbsp;            Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
+&nbsp;            engaging multiple transactions at the same time. You must sell before buying again.
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre><strong>Input:</strong> [7,6,4,3,1]
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> In this case, no transaction is done, i.e. max profit = 0.</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= prices.length &lt;= 3 * 10 ^ 4</code></li>
+	<li><code>0 &lt;= prices[i]&nbsp;&lt;= 10 ^ 4</code></li>
+</ul>
+</div>