Adding solutions for Tasks Before Session 6

Author: tachyonlabs

README.md

@@ -193,3 +193,16 @@ And here's a GIF of my updated InterviewBit Graphs topic page:
 * [GIF of my updated InterviewBit Graphs topic page](https://github.com/tachyonlabs/CodePath-Alumni-Professional-Interview-Prep-Course/blob/master/interviewbit-graphs-topics-2.gif)
 
 I took the "CodePath Interview Prep - Unit 5" test on January 28, so you should have received it.
+
+## Tasks Before Session 6
+
+I've done four Dynamic Programming problems on InterviewBit so far: 
+
+* Stairs
+* Jump Game Array
+* Min Sum Path in Matrix
+* Min Sum Path in Triangle
+
+And here's a GIF of my InterviewBit Dynamic Programming topic page:
+
+* GIF of my InterviewBit Dynamic Programming topic page

interviewbit-dynamic-programming-jump-game-array.py

@@ -0,0 +1,12 @@
+class Solution:
+    # @param A : list of integers
+    # @return an integer
+    def canJump(self, A):
+        min_possible = len(A) - 1
+        for i in range(len(A) - 1, -1, -1):
+            if A[i] >= min_possible - i:
+                min_possible = i
+            if min_possible == 0:
+                return 1
+
+        return 0

interviewbit-dynamic-programming-min-sum-path-in-matrix.py

@@ -0,0 +1,14 @@
+class Solution:
+    # @param A : list of list of integers
+    # @return an integer
+    def minPathSum(self, A):
+        for r in range(len(A) - 1, -1, -1):
+            for c in range(len(A[0]) - 1, -1, -1):
+                if r < len(A) - 1 and c < len(A[0]) - 1:
+                    A[r][c] += min(A[r + 1][c], A[r][c + 1])
+                elif r < len(A) - 1:
+                    A[r][c] += A[r + 1][c]
+                elif c < len(A[0]) - 1:
+                    A[r][c] += A[r][c + 1]
+
+        return A[0][0]

interviewbit-dynamic-programming-min-sum-path-in-triangle.py

@@ -0,0 +1,14 @@
+class Solution:
+    # @param A : list of list of integers
+    # @return an integer
+    def minimumTotal(self, A):
+        if len(A) == 1:
+            return A[0][0]
+
+        print A
+        for r in range(len(A) - 2, -1, -1):
+            for c in range(len(A[r])):
+                A[r][c] += min(A[r + 1][c], A[r + 1][c + 1])
+                print A
+
+        return A[0]

interviewbit-dynamic-programming-stairs.py

@@ -0,0 +1,11 @@
+class Solution:
+    # @param A : integer
+    # @return an integer
+    def __init__(self):
+        self.fibs = [0, 1]
+
+    def climbStairs(self, A):
+        while A >= len(self.fibs) - 2:
+            self.fibs.append(self.fibs[-1] + self.fibs[-2])
+
+        return self.fibs[A + 1]