diff --git a/Find_maximum_number_of_string_of_pairs_in_Java b/Find_maximum_number_of_string_of_pairs_in_Java
new file mode 100644
index 0000000..41d8369
--- /dev/null
+++ b/Find_maximum_number_of_string_of_pairs_in_Java
@@ -0,0 +1,18 @@
+class Solution {
+    public int maximumNumberOfStringPairs(String[] words) {
+        int count = 0;
+
+        for (int i = 0; i < words.length; i++) {
+            String reversed = "" + words[i].charAt(1) + words[i].charAt(0);  // invertir la palabra, solo cambiar el orden de las dos letras
+
+            for (int j = i + 1; j < words.length; j++) { //iterar sobre los demas elementos del arreglo
+                if (reversed.equals(words[j])) {
+                    count++;// si lo encuentra aumenta el contador
+                    break;//salir del loop
+                }
+            }
+        }
+
+        return count;
+    }
+}