Shortest Distance Between Words #1685

Java/README.md

@@ -47,6 +47,7 @@ _add list here_
 - [Ugly Number With Recursion](cp/UglyRecursion.java) 
 - [PDDI Using Recursion](cp/ArmStrongRecursion.java)
 - [Subarray of an array with given sum in O(n) time](cp/Subarray.java)
+- [Shortest Distance Between Words](cp/Shortest_Dist.java)
 
 ## Cryptography
 

Java/cp/Shortest_Dist.java

@@ -0,0 +1,86 @@
+/* Given a list of words and two words word1 and word2, find the shortest distance between those two words from the list.
+ */
+import java.util.*;
+class Shortest_Dist {
+    static List < String > arr;
+    public static void main(String args[]) {
+        int t = 0;
+
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter the list of words " + "\n" + "Words = ");
+        arr = new ArrayList <> ();
+
+        arr.add(sc.nextLine());
+        while (sc.hasNext()) {
+            arr.add(sc.nextLine());
+            if (sc.hasNextInt()) {
+                t = sc.nextInt();
+                break;
+            }
+
+        }
+
+        List < String > wd = new ArrayList(arr);
+        while (t > 0) {
+            String wd1 = sc.next();
+            String wd2 = sc.next();
+            System.out.println(" The shortest Distance between " + wd1 + " and " + wd2 + " is : " + shortest_dist(wd, wd1, wd2));
+            wd = new ArrayList(arr);
+
+            t--;
+        }
+
+    }
+    public static int shortest_dist(List < String > wd, String wd1, String wd2) {
+        int dist = -1;
+        List < String > wdcopy = new ArrayList(wd);
+        List < Integer > ind1 = new ArrayList <> ();
+        List < Integer > ind2 = new ArrayList <> ();
+
+        while (wd.contains(wd1)) {
+            ind1.add(wd.indexOf(wd1));
+            //
+            wd.add(wd.indexOf(wd1), "0");
+            wd.remove(wd.indexOf(wd1));
+
+        }
+
+        while (wdcopy.contains(wd2)) {
+            ind2.add(wdcopy.indexOf(wd2));
+
+            wdcopy.add(wdcopy.indexOf(wd2), "0");
+            wdcopy.remove(wdcopy.indexOf(wd2));
+        }
+
+        for (int i = 0; i < ind1.size(); i++) {
+            for (int j = 0; j < ind2.size(); j++) {
+                int d = (int) Math.abs(ind1.get(i) - ind2.get(j));
+                if (dist == -1)
+                    dist = d;
+                else if ((dist != -1) && (d < dist))
+                    dist = d;
+            }
+        }
+        return dist;
+
+    }
+}
+/*Sample Input And Output : 
+ * Enter the list of words 
+Words = 
+practice
+makes
+perfect
+coding
+makes
+2
+practice
+coding
+ The shortest Distance between practice and coding is : 3
+coding
+makes
+ The shortest Distance between coding and makes is : 1
+
+ Timple Complexity : O(n)
+ Space Complexity : O(1)
+ */