working commit - Created using LeetHub

Author: JanaSabuj

last-stone-weight/README.md

@@ -0,0 +1,32 @@
+<h2>unknown-problem</h2><h3>Easy</h3><hr><div><p>We have a collection of stones, each stone&nbsp;has a positive integer weight.</p>
+
+<p>Each turn, we choose the two <strong>heaviest</strong>&nbsp;stones&nbsp;and smash them together.&nbsp; Suppose the stones have weights <code>x</code> and <code>y</code> with <code>x &lt;= y</code>.&nbsp; The result of this smash is:</p>
+
+<ul>
+	<li>If <code>x == y</code>, both stones are totally destroyed;</li>
+	<li>If <code>x != y</code>, the stone of weight <code>x</code> is totally destroyed, and the stone of weight <code>y</code> has new weight <code>y-x</code>.</li>
+</ul>
+
+<p>At the end, there is at most 1 stone left.&nbsp; Return the weight of this stone (or 0 if there are no stones left.)</p>
+
+<p>&nbsp;</p>
+
+<p><strong>Example 1:</strong></p>
+
+<pre><strong>Input: </strong>[2,7,4,1,8,1]
+<strong>Output: </strong>1
+<strong>Explanation: </strong>
+We combine 7 and 8 to get 1 so the array converts to [2,4,1,1,1] then,
+we combine 2 and 4 to get 2 so the array converts to [2,1,1,1] then,
+we combine 2 and 1 to get 1 so the array converts to [1,1,1] then,
+we combine 1 and 1 to get 0 so the array converts to [1] then that's the value of last stone.</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>Note:</strong></p>
+
+<ol>
+	<li><code>1 &lt;= stones.length &lt;= 30</code></li>
+	<li><code>1 &lt;= stones[i] &lt;= 1000</code></li>
+</ol>
+</div>