diff --git a/algorithms/Java/stacks/Next_Greater_Element.java b/algorithms/Java/stacks/Next_Greater_Element.java
index 887025f9..500cb82e 100644
--- a/algorithms/Java/stacks/Next_Greater_Element.java
+++ b/algorithms/Java/stacks/Next_Greater_Element.java
@@ -32,7 +32,7 @@ import java.util.Stack;
           }
           long ans[]=nextLargerElement(arr,n);  // functions that print array for calculating next greater element
           for (int i=0;i<ans.length;i++){
-            System.out.print(ans[i]+" ")
+            System.out.print(ans[i]+" ");
           }
     }
       public static long[] nextLargerElement(long[] arr, int n)
diff --git a/algorithms/Java/stacks/stack.java b/algorithms/Java/stacks/stack.java
index bf884e76..b7e77b7e 100644
--- a/algorithms/Java/stacks/stack.java
+++ b/algorithms/Java/stacks/stack.java
@@ -79,7 +79,7 @@
 class Main {
 
     public static void main(String[] args){
-    	max = 1000;
+    	int max = 1000;
         stack object = new stack(max);
         object.push(1);
         object.push(2);
diff --git a/algorithms/Java/strings/Longest_common_substring.java b/algorithms/Java/strings/Longest_common_substring.java
index 04bfc00e..224af739 100644
--- a/algorithms/Java/strings/Longest_common_substring.java
+++ b/algorithms/Java/strings/Longest_common_substring.java
@@ -57,11 +57,11 @@ class GFG {
 		System.out.println(LCSubStr(X.toCharArray(), Y.toCharArray(), m, n));
 		
 		// Test 2:
-		String X = "abcdefgh";
-		String Y = "abaabcfg";
-		int m = X.length();
-		int n = Y.length();
-		System.out.println(LCSubStr(X.toCharArray(), Y.toCharArray(), m, n));
+		String X2 = "abcdefgh";
+		String Y2 = "abaabcfg";
+		int m2 = X.length();
+		int n2 = Y.length();
+		System.out.println(LCSubStr(X2.toCharArray(), Y2.toCharArray(), m2, n2));
 	}
 }
 // Time Complexity -> O(m*n)