Merge pull request matthewsamuel95#322 from shikharp16/lcspy

Added LCS code in Python

Author: matthewsamuel95

DP/LongestCommonSubsequence/LCS.py

@@ -0,0 +1,22 @@
+def lcs(X , Y): 
+    # find the length of the strings 
+    m = len(X) 
+    n = len(Y) 
+  
+    # declaring the array for storing the dp values 
+    L = [[None]*(n+1) for i in xrange(m+1)] 
+  
+    """Following steps build L[m+1][n+1] in bottom up fashion 
+    Note: L[i][j] contains length of LCS of X[0..i-1] 
+    and Y[0..j-1]"""
+    for i in range(m+1): 
+        for j in range(n+1): 
+            if i == 0 or j == 0 : 
+                L[i][j] = 0
+            elif X[i-1] == Y[j-1]: 
+                L[i][j] = L[i-1][j-1]+1
+            else: 
+                L[i][j] = max(L[i-1][j] , L[i][j-1]) 
+  
+    # L[m][n] contains the length of LCS of X[0..n-1] & Y[0..m-1] 
+    return L[m][n] 

Greedy/MinimumCoins/mincoins.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+  
+// All denominations of Indian Currency 
+int deno[] = {1, 2, 5, 10, 20, 50, 100, 500, 1000}; 
+int n = sizeof(deno)/sizeof(deno[0]); 
+  
+// Driver program 
+void findMin(int V) 
+{ 
+    // Initialize result 
+    vector<int> ans; 
+  
+    // Traverse through all denomination 
+    for (int i=n-1; i>=0; i--) 
+    { 
+        // Find denominations 
+        while (V >= deno[i]) 
+        { 
+           V -= deno[i]; 
+           ans.push_back(deno[i]); 
+        } 
+    } 
+  
+    // Print result 
+    for (int i = 0; i < ans.size(); i++) 
+           cout << ans[i] << "  "; 
+} 
+  
+// Driver program 
+int main() 
+{ 
+   int n;
+   cin>>n;
+   cout << "Following is minimal number of change for " << n << " is "; 
+   findMin(n); 
+   return 0;