diff --git a/.idea/misc.xml b/.idea/misc.xml
new file mode 100644
index 00000000..84da703c
--- /dev/null
+++ b/.idea/misc.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 00000000..9281dbd3
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,8 @@
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
new file mode 100644
index 00000000..35eb1ddf
--- /dev/null
+++ b/.idea/vcs.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
new file mode 100644
index 00000000..6d7e1eea
--- /dev/null
+++ b/.idea/workspace.xml
@@ -0,0 +1,908 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1509061173668
+
+
+ 1509061173668
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/Dynamic Programming/Levenshtein_distance.java b/Dynamic Programming/Levenshtein_distance.java
index 49f39902..8a5f7249 100644
--- a/Dynamic Programming/Levenshtein_distance.java
+++ b/Dynamic Programming/Levenshtein_distance.java
@@ -17,8 +17,8 @@ public class Levenshtein_distance{
}
}
private static int calculate_distance(String a, String b){
- len_a = a.length() + 1;
- len_b = b.length() + 1;
+ int len_a = a.length() + 1;
+ int len_b = b.length() + 1;
int [][] distance_mat = new int[len_a][len_b];
for(int i = 0; i < len_a; i++){
distance_mat[i][0] = i;
diff --git a/Dynamic Programming/rod_cutting.java b/Dynamic Programming/rod_cutting.java
index 3424afac..cd251205 100644
--- a/Dynamic Programming/rod_cutting.java
+++ b/Dynamic Programming/rod_cutting.java
@@ -2,8 +2,7 @@
Returns the best obtainable price for a rod of
length n and price[] as prices of different pieces */
-public class RodCutting
-{
+public class RodCutting {
private static int cutRod(int price[],int n)
{
diff --git a/Java.iml b/Java.iml
new file mode 100644
index 00000000..3034bb4e
--- /dev/null
+++ b/Java.iml
@@ -0,0 +1,13 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/Others/Abecedarian.java b/Others/Abecedarian.java
index 6507411b..acde132c 100644
--- a/Others/Abecedarian.java
+++ b/Others/Abecedarian.java
@@ -12,6 +12,6 @@ class Abecedarian{
else{return false;}
}
- }
return true;
+ }
}
diff --git a/Others/Dijkshtra.java b/Others/Dijkshtra.java
index 377c487e..741c9bd3 100644
--- a/Others/Dijkshtra.java
+++ b/Others/Dijkshtra.java
@@ -4,6 +4,11 @@
*/
+import java.io.IOException;
+import java.util.Arrays;
+import java.util.Scanner;
+import java.util.Stack;
+
public class Solution {
public static void main(String[] args) throws IOException {
@@ -30,7 +35,7 @@ public static void main(String[] args) throws IOException {
//Implementing Dijkshtra's Algorithm
- Stack t=new Stack();
+ Stack t=new Stack();
int src=in.nextInt();
for(int i=1;i<=n;i++){
if(i!=src){t.push(i);}}
diff --git a/Others/Factorial.java b/Others/Factorial.java
index b7cc906a..11265ec0 100644
--- a/Others/Factorial.java
+++ b/Others/Factorial.java
@@ -1,4 +1,3 @@
-package factorial;
import java.util.Scanner;
/**
diff --git a/Others/FloydTriangle.java b/Others/FloydTriangle.java
index 243a4b1a..f655b68a 100644
--- a/Others/FloydTriangle.java
+++ b/Others/FloydTriangle.java
@@ -1,6 +1,5 @@
import java.util.Scanner;
-
public class FloydTriangle {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
diff --git a/Others/ReverseStackUsingRecursion.java b/Others/ReverseStackUsingRecursion.java
index bb9f606a..99f1ab3b 100644
--- a/Others/ReverseStackUsingRecursion.java
+++ b/Others/ReverseStackUsingRecursion.java
@@ -67,8 +67,4 @@ public class ReverseStackUsingRecursion {
}
-
-
-
-
}
diff --git a/Others/ReverseString.java b/Others/ReverseString.java
index 81498858..9f4d9775 100644
--- a/Others/ReverseString.java
+++ b/Others/ReverseString.java
@@ -39,7 +39,7 @@ class ReverseString
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the string");
String srr=br.readLine();
- System.out.println("Reverse="+reverseString(srr));
+ System.out.println("Reverse="+reverse(srr));
br.close();
}
}
diff --git a/Others/krishnamurthy.java b/Others/krishnamurthy.java
index f8137513..66685bcc 100644
--- a/Others/krishnamurthy.java
+++ b/Others/krishnamurthy.java
@@ -1,4 +1,5 @@
import java.util.Scanner;
+
class krishnamurthy
{
int fact(int n)
diff --git a/Others/root_precision.java b/Others/root_precision.java
index 0ae00de0..0b401b98 100644
--- a/Others/root_precision.java
+++ b/Others/root_precision.java
@@ -1,8 +1,4 @@
-import java.io.*;
import java.util.*;
-import java.text.*;
-import java.math.*;
-import java.util.regex.*;
public class Solution {
diff --git a/Sorts/radixSort.java b/Sorts/radixSort.java
index 572917b5..5afacad8 100644
--- a/Sorts/radixSort.java
+++ b/Sorts/radixSort.java
@@ -1,5 +1,3 @@
-
-import java.io.*;
import java.util.*;
class Radix {
diff --git a/data_structures/Graphs/PrimMST.java b/data_structures/Graphs/PrimMST.java
index 2d366086..9d8c2d35 100644
--- a/data_structures/Graphs/PrimMST.java
+++ b/data_structures/Graphs/PrimMST.java
@@ -1,9 +1,7 @@
// A Java program for Prim's Minimum Spanning Tree (MST) algorithm.
//adjacency matrix representation of the graph
-
-import java.util.*;
+
import java.lang.*;
-import java.io.*;
class PrimMST
{
diff --git a/data_structures/HashMap/HashMap.java b/data_structures/HashMap/HashMap.java
index efb55c35..df9af325 100644
--- a/data_structures/HashMap/HashMap.java
+++ b/data_structures/HashMap/HashMap.java
@@ -1,5 +1,3 @@
-
-
import java.util.ArrayList;
import java.util.LinkedList;