update: Readme

Author: Ankit-29

Directory/Dynamic_Programming.md

@@ -3,7 +3,7 @@
 
 | ID            | Title        | Solution  |
 | ------------- |:-------------:| -----:|
-| 53            | Maximum Subarray      | [Python3](https://github.com/devmins-code/Leetcode_Solutions/blob/master/Dynamic_Progamming/0053_Maximum_Subarray.py)|
+| 53            | Maximum Subarray      | [Python3](https://github.com/devmins-code/Leetcode_Solutions/blob/master/Dynamic_Programming/0053_Maximum_Subarray.py)|
 | 70             |Climbing Stairs       | [Python3](https://github.com/devmins-code/Leetcode_Solutions/blob/master/Dynamic_Programming/0070_Climbing_Stairs.py)|