Merge branch 'Py-Contributors:master' into master

Author: abhijeet147

Java/Algorithm/DynamicProgramming/Kadane/Kadane.java

@@ -0,0 +1,31 @@
+import java.util.*;
+
+class KadanesAlgo
+{
+	public static void main (String[] args) throws java.lang.Exception
+	{
+	   
+	    Scanner sc=new Scanner(System.in);  
+        System.out.print("Enter the number of elements you want to store: ");  
+        int n=sc.nextInt();  
+        int[] a = new int[100];  
+        System.out.println("Enter the elements of the array: ");  
+        for(int i=0; i<n; i++)  {  
+            a[i]=sc.nextInt();  
+        }  
+        int local_max = 0;
+        int global_max = Integer.MIN_VALUE;
+        
+        for(int i=0;i<n;i++)
+    	{
+    	    local_max = Math.max(a[i], a[i] + local_max);
+    	    
+    	    if(local_max > global_max)
+    	    {
+    	        global_max = local_max;
+    	    }
+    	    
+    	}
+        System.out.println("Maximum Subarray sum: " +global_max);
+	}
+}

Java/Algorithm/DynamicProgramming/LCS/LCS.java

@@ -0,0 +1,59 @@
+import java.util.Scanner;  
+  
+class LCSExample1 {  
+    public static String findLengthOfLCS(String str1, String str2, int p, int q) {  
+        int[][] tableForLCS = new int[p + 1][q + 1];  
+        for (int i = 0; i <= p; i++) {  
+            for (int j = 0; j <= q; j++) {  
+                if (i == 0 || j == 0)  
+                    tableForLCS[i][j] = 0; 
+                else if (str1.charAt(i - 1) == str2.charAt(j - 1))  
+                    tableForLCS[i][j] = tableForLCS[i - 1][j - 1] + 1;  
+                else  
+                    tableForLCS[i][j] = Math.max(tableForLCS[i - 1][j], tableForLCS[i][j - 1]);     
+            }  
+        }
+        int index = tableForLCS[p][q];  
+        int temp = index;  
+        char[] longestCommonSubsequence = new char[index + 1];  
+        longestCommonSubsequence[index] = '\0';  
+        int i = p, j = q;  
+        String lcs ="";  
+        while (i > 0 && j > 0) {  
+            if (str1.charAt(i - 1) == str2.charAt(j - 1)) {  
+                  
+                longestCommonSubsequence[index - 1] = str1.charAt(i - 1);  
+                i--;  
+                j--;  
+                index--;  
+            }  
+            else if (tableForLCS[i - 1][j] > tableForLCS[i][j - 1])  
+                i--;  
+            else  
+                j--;  
+        }  
+        for (int k = 0; k <= temp; k++)  
+            lcs = lcs + longestCommonSubsequence[k];  
+              
+        return lcs;  
+    }  
+    public static void main(String[] args) {  
+          
+        String str1, str2, LCS;  
+          
+        Scanner sc= new Scanner(System.in); 
+        System.out.print("Enter first sequence: ");  
+        str1 = sc.nextLine(); 
+          
+        System.out.print("Enter second sequence: ");  
+        str2 = sc.nextLine(); 
+          
+        int p = str1.length();  
+        int q = str2.length();  
+          
+        LCS = findLengthOfLCS(str1, str2, p, q);  
+          
+        System.out.println("LCS: "+LCS);  
+          
+    }  
+}  

Java/Algorithm/DynamicProgramming/LIS/LIS.java

@@ -0,0 +1,41 @@
+import java.util.*;
+
+public class LIS {
+    public static void main(String[] args){
+
+        Scanner sc=new Scanner(System.in);  
+        System.out.print("Enter the number of elements you want to store: ");  
+        int n=sc.nextInt();  
+        int[] nums= new int[100];  
+        System.out.println("Enter the elements of the array: ");  
+        for(int i=0; i<n; i++)  {  
+            nums[i]=sc.nextInt();  
+        }  
+        printLIS(nums);
+    }
+        public static void printLIS(int[] nums){
+        String[] paths = new String[nums.length];
+        int[] sizes = new int[nums.length];
+
+        for(int i=0; i<nums.length; i++){
+            sizes[i] = 1;
+            paths[i] = nums[i] + " " ;
+        }
+    int maxLength = 1; 
+
+    for(int i=1; i<nums.length; i++){ 
+        for(int j=0; j<nums.length; j++){
+    if(nums[i]>nums[j] && sizes[i] < sizes[j] + 1){;
+        sizes[i] = sizes[j] + 1;
+        paths[i] = paths[j] + nums[i] + " "; 	
+        if(maxLength < sizes[i])
+            maxLength = sizes[i];
+        }
+    }
+    }
+    for(int i=1; i<nums.length; i++){
+        if(sizes[i] == maxLength)
+        System.out.println("LIS: " + paths[i]);
+    }
+    }
+}

Java/Algorithm/DynamicProgramming/NoOfSubsequences/Subsequences.java

@@ -0,0 +1,43 @@
+import java.util.*;
+
+public class Subsequences {
+public static void main(String[] args) {
+	Scanner sc=new Scanner(System.in);  
+	System.out.print("Enter the number of elements you want to store: ");  
+	int n=sc.nextInt();  
+	int[] arr= new int[100];  
+	System.out.println("Enter the elements of the array: ");  
+	for(int i=0; i<n; i++)  {  
+		arr[i]=sc.nextInt();  
+	}
+	System.out.print("Enter Sum: ");
+	int X = sc.nextInt();
+	System.out.println(countSubsequence(arr, n, X));
+}
+
+public static int countSubsequence(int[] A, int N, int X) {
+	int[][] dp = new int[N+1][X+1];
+	for (int[] row : dp) {
+	Arrays.fill(row, 0);
+	}
+	for (int i = 0; i <= N; i++) {
+	for (int j = 0; j <= X; j++) {
+		if (i == N) {
+		dp[i][j] = 1;
+		}
+	}
+	}
+
+	for (int i = N-1; i >= 0; i--) {
+	for (int j = 1; j <= X; j++) {
+		if (A[i] <= j) {
+		dp[i][j] = dp[i+1][j] + dp[i+1][j-A[i]];
+		} else {
+		dp[i][j] = dp[i+1][j];
+		}
+	}
+	}
+	System.out.print("Number of Subsequences with sum less than or equal to given sum: ");
+	return dp[0][X] - 1;
+}
+}

README.md

@@ -1,10 +1,10 @@
 <p align="center">
-  <a href="http://codeperfectplus.herokuapp.com/"><img src="https://capsule-render.vercel.app/api?type=rect&color=666666&height=100&section=header&text=Algorithms%20And%20Data%20Structures&fontSize=55%&fontColor=ffffff&fontAlignY=65" alt="website title image"></a>
+  <a href="http://codeperfectplus.com/"><img src="https://capsule-render.vercel.app/api?type=rect&color=666666&height=100&section=header&text=Algorithms%20And%20Data%20Structures&fontSize=55%&fontColor=ffffff&fontAlignY=65" alt="website title image"></a>
   <h2 align="center">👉 A Collection of Algorithms And Data Structures in C++ and Python 👈</h2>
 </p>
 
 <p align="center">
- <a href="http://codeperfectplus.herokuapp.com/"><img src="https://capsule-render.vercel.app/api?type=rect&color=666444&height=40&section=header&text=Hacktoberfest%20Excluded&fontSize=35%&fontColor=ffffff&fontAlignY=65" alt="website title image"></a>
+ <a href="http://codeperfectplus.com/"><img src="https://capsule-render.vercel.app/api?type=rect&color=666444&height=40&section=header&text=Hacktoberfest%20Excluded&fontSize=35%&fontColor=ffffff&fontAlignY=65" alt="website title image"></a>
 </p>
 
 <p align="center">
@@ -31,25 +31,17 @@
 <a href="https://api.github.com/repos/codeperfectplus/AlgorithmsAndDataStructure/contributors"><img src="https://img.shields.io/github/contributors/codeperfectplus/AlgorithmsAndDataStructure?style=for-the-badge" alt="total contributors"></a>
 </p>
 
-
 - [Introduction](#introduction)
 - [Data Structures](#data-structures) <!-- Data Structure hyperlink in the readme doesn't link #925 issue solved. P.S. It was a typo -->
 - [Algorithms](#algorithms)
 - [Languages](#languages)
 - [Support](#support)
 - [Project Progress](#project-progress)
 - [Contributing](#contributing)
-- [Authors and acknowledgment](#authors-and-acknowledgment)
+- [Authors and acknowledgement](#authors-and-acknowledgement)
 - [License](#license)
 - [Maintainers](#maintainers)
 
-
-**Anyone Interested in managing the repository for the upcoming HacktoberFest2021, email us at `pycontributors@gmail.com`**
-
-- Must be a student
-- Must have knowledge of Git Commands ex- branching, merging etc
-- Must have Python/C++ DS and Algo knowledge to review code.
-
 ## Introduction
 
 Data structures & algorithms are an essential part of programming. They both fall under the fundamentals of computer science. Understanding these gives us the advantage of writing better and more efficient code in less time. They are key topics when it comes to acing software engineering interview questions, so as developers, we must have knowledge of data structures and algorithms.
@@ -58,7 +50,6 @@ Data structures & algorithms are an essential part of programming. They both fal
 :fork_and_knife:Fork it
 :handshake: Contribute to it!
 
-
 ## Data Structures
 
 In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification.
@@ -89,9 +80,9 @@ Check [Contribution](/CONTRIBUTING.md) Guide Before Contribution.
 - Create separate issues for Python and C++.
 - You can only work on issues that you have been assigned to.
 - Use Flake8 locally for linting Python Code. `pip install flake8`.
-  (We have linting checks so if your code fails it we will not merge the PR.)
+  (We have linting checks so if your code fails we will not merge the PR.)
 
-## Authors and acknowledgment
+## Authors and acknowledgement
 
 Show your appreciation to those who have contributed to the project.
 
@@ -135,9 +126,9 @@ For open-source projects, Under [MIT License](/LICENSE).
 
 ## Must Read Articles
 
-- [5 Tips for computer programming begineers](https://codeperfectplus.herokuapp.com/5-tips-for-computer-programming-beginners)
-- [What is HacktoberFest](https://codeperfectplus.herokuapp.com/what-is-hacktoberfest)
-- [What is Git and Github](https://codeperfectplus.herokuapp.com/what-is-git-and-gitHub)
+- [How to Solve Linear Equations with Matrix Inversion](https://codeperfectplus.com/how-to-solve-linear-equations-with-matrix-inversion)
+- [HackerRank Algorithms Solutions using Python and C++](https://codeperfectplus.com/hackerrank-algorithms-solutions-using-python-and-c-cpp)
+- [30 Days of Code - HackerRank](https://codeperfectplus.com/category/hackerank-30daysofcode/)
 
 <p align="center">
 <a href="https://api.github.com/repos/py-contributors/AlgorithmsAndDataStructure/contributors"><img src="http://ForTheBadge.com/images/badges/built-by-developers.svg" alt="built by developers"></a>