update readme

Author: hogan-tech

0312-burst-balloons/0312-burst-balloons.py

@@ -30,17 +30,16 @@ class Solution:
     def maxCoins(self, nums: List[int]) -> int:
         if len(nums) > 1 and len(set(nums)) == 1:
             return (nums[0] ** 3) * (len(nums) - 2) + nums[0] ** 2 + nums[0]
-
         nums = [1] + nums + [1]
         n = len(nums)
-        dp = [[0] * n for _ in range(n)]
-
+        dp = [[0 for _ in range(n)] for _ in range(n)]
         for left in range(n - 2, 0, -1):
             for right in range(left, n - 1):
                 for i in range(left, right + 1):
                     gain = nums[left - 1] * nums[i] * nums[right + 1]
                     remaining = dp[left][i - 1] + dp[i + 1][right]
                     dp[left][right] = max(remaining + gain, dp[left][right])
+        
         return dp[1][n - 2]
 '''
 1. What is dp_state?

0312-burst-balloons/README.md

@@ -115,23 +115,3 @@ It helps others discover the repo and keeps the project growing.
 ---
 
 Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)  
-
-<!---LeetCode Topics Start-->
-# LeetCode Topics
-## Math
-|  |
-| ------- |
-| [3676-smallest-number-with-all-set-bits](https://github.com/hogan-tech/leetcode-solution/tree/master/3676-smallest-number-with-all-set-bits) |
-## Bit Manipulation
-|  |
-| ------- |
-| [3676-smallest-number-with-all-set-bits](https://github.com/hogan-tech/leetcode-solution/tree/master/3676-smallest-number-with-all-set-bits) |
-## Array
-|  |
-| ------- |
-| [0312-burst-balloons](https://github.com/hogan-tech/leetcode-solution/tree/master/0312-burst-balloons) |
-## Dynamic Programming
-|  |
-| ------- |
-| [0312-burst-balloons](https://github.com/hogan-tech/leetcode-solution/tree/master/0312-burst-balloons) |
-<!---LeetCode Topics End-->

3676-smallest-number-with-all-set-bits/3676-smallest-number-with-all-set-bits.py

@@ -1,4 +1,4 @@
-<h2><a href="https://leetcode.com/problems/burst-balloons/">312. Burst Balloons</a></h2><h3>Hard</h3><hr><div><p>You are given <code>n</code> balloons, indexed from <code>0</code> to <code>n - 1</code>. Each balloon is painted with a number on it represented by an array <code>nums</code>. You are asked to burst all the balloons.</p>
+<h2><a href="https://leetcode.com/problems/burst-balloons">312. Burst Balloons</a></h2><h3>Hard</h3><hr><p>You are given <code>n</code> balloons, indexed from <code>0</code> to <code>n - 1</code>. Each balloon is painted with a number on it represented by an array <code>nums</code>. You are asked to burst all the balloons.</p>
 
 <p>If you burst the <code>i<sup>th</sup></code> balloon, you will get <code>nums[i - 1] * nums[i] * nums[i + 1]</code> coins. If <code>i - 1</code> or <code>i + 1</code> goes out of bounds of the array, then treat it as if there is a balloon with a <code>1</code> painted on it.</p>
 
@@ -7,15 +7,17 @@
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre><strong>Input:</strong> nums = [3,1,5,8]
+<pre>
+<strong>Input:</strong> nums = [3,1,5,8]
 <strong>Output:</strong> 167
 <strong>Explanation:</strong>
 nums = [3,1,5,8] --&gt; [3,5,8] --&gt; [3,8] --&gt; [8] --&gt; []
 coins =  3*1*5    +   3*5*8   +  1*3*8  + 1*8*1 = 167</pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre><strong>Input:</strong> nums = [1,5]
+<pre>
+<strong>Input:</strong> nums = [1,5]
 <strong>Output:</strong> 10
 </pre>
 
@@ -27,4 +29,3 @@ coins =  3*1*5    +   3*5*8   +  1*3*8  + 1*8*1 = 167</pre>
 	<li><code>1 &lt;= n &lt;= 300</code></li>
 	<li><code>0 &lt;= nums[i] &lt;= 100</code></li>
 </ul>
-</div>