no message

Author: Partho Biswas

README.md

@@ -1191,6 +1191,7 @@ Learn the following modules by heart. Just knowing all of the following items wi
 08. **[Dynamic Programming Patterns - MUST READ](https://tinyurl.com/tenzf8b)**
 09. **[My experience and notes for learning DP](https://tinyurl.com/rjg4vtg)**
 10. **[DP IS EASY! 5 Steps to Think Through DP Questions](https://tinyurl.com/vmmaxbe)**
+11. **[Dynamic Programming Patterns](https://tinyurl.com/tenzf8b)**
 
 </p>
 </details>

leetcode.com/python/375_Guess_Number_Higher_or_Lower_II.py

@@ -7,9 +7,15 @@ def dfs(self, start, end, record):
             return start
 
         if record[start][end] is None:
-            record[start][end] = min(
-                (i + max(self.dfs(start, i - 1, record), self.dfs(i + 1, end, record))) for i in range(start, end + 1)
-            )
+            pays = []
+            for i in range(start, end + 1):
+                prevPay = self.dfs(start, i - 1, record)
+                nextPay = self.dfs(i + 1, end, record)
+                currPay = i
+                totlPay = currPay + max(prevPay, nextPay)
+                pays.append(totlPay)
+
+            record[start][end] = min(pays)
 
         return record[start][end]