Resolved Method Name Bug

Author: cpu-pixel

src/main/java/com/thealgorithms/ciphers/DES.java

@@ -106,7 +106,7 @@ private String[] getSubkeys(String originalKey) {
         return subKeys;
     }
 
-    private String XOR(String a, String b) {
+    private String xOR(String a, String b) {
         int i;
         int l = a.length();
         StringBuilder xor = new StringBuilder();
@@ -143,7 +143,7 @@ private String feistel(String messageBlock, String key) {
         for (i = 0; i < 48; i++) {
             expandedKey.append(messageBlock.charAt(EXPANSION[i] - 1));
         }
-        String mixedKey = XOR(expandedKey.toString(), key);
+        String mixedKey = xOR(expandedKey.toString(), key);
         StringBuilder substitutedString = new StringBuilder();
 
         // Let us now use the s-boxes to transform each 6 bit (length here) block to 4 bits
@@ -175,7 +175,7 @@ private String encryptBlock(String message, String[] keys) {
         // Iterate 16 times
         for (i = 0; i < 16; i++) {
             String eN = f0; // Previous Right block
-            String fN = XOR(e0, feistel(f0, keys[i]));
+            String fN = xOR(e0, feistel(f0, keys[i]));
             e0 = eN;
             f0 = fN;
         }

src/main/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequence.java

@@ -20,7 +20,7 @@ private static int upperBound(int[] ar, int l, int r, int key) {
         return r;
     }
 
-    public static int LIS(int[] array) {
+    public static int lis(int[] array) {
         int len = array.length;
         if (len == 0) {
             return 0;

src/main/java/com/thealgorithms/searches/KMPSearch.java

@@ -2,7 +2,7 @@
 
 class KMPSearch {
 
-    int KMPSearch(String pat, String txt) {
+    int kmpSearch(String pat, String txt) {
         int m = pat.length();
         int n = txt.length();
 

src/test/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplicationTest.java

@@ -12,7 +12,7 @@ class StrassenMatrixMultiplicationTest {
     // and has to be a Square Matrix
 
     @Test
-    public void StrassenMatrixMultiplicationTest2x2() {
+    public void strassenMatrixMultiplicationTest2x2() {
         int[][] a = {{1, 2}, {3, 4}};
         int[][] b = {{5, 6}, {7, 8}};
         int[][] expResult = {{19, 22}, {43, 50}};
@@ -21,7 +21,7 @@ public void StrassenMatrixMultiplicationTest2x2() {
     }
 
     @Test
-    void StrassenMatrixMultiplicationTest4x4() {
+    void strassenMatrixMultiplicationTest4x4() {
         int[][] a = {{1, 2, 5, 4}, {9, 3, 0, 6}, {4, 6, 3, 1}, {0, 2, 0, 6}};
         int[][] b = {{1, 0, 4, 1}, {1, 2, 0, 2}, {0, 3, 1, 3}, {1, 8, 1, 2}};
         int[][] expResult = {{7, 51, 13, 28}, {18, 54, 42, 27}, {11, 29, 20, 27}, {8, 52, 6, 16}};
@@ -30,7 +30,7 @@ void StrassenMatrixMultiplicationTest4x4() {
     }
 
     @Test
-    void StrassenMatrixMultiplicationTestNegetiveNumber4x4() {
+    void strassenMatrixMultiplicationTestNegetiveNumber4x4() {
         int[][] a = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}, {13, 14, 15, 16}};
         int[][] b = {{1, -2, -3, 4}, {4, -3, -2, 1}, {5, -6, -7, 8}, {8, -7, -6, -5}};
         int[][] expResult = {{56, -54, -52, 10}, {128, -126, -124, 42}, {200, -198, -196, 74}, {272, -270, -268, 106}};