Related to TheAlgorithms#5478

was facing error regarding pom.xml file -lossy-conversions, to fix it needed to make some type casting and cleanup of code in AliquotSum.java, Caesar.java, PerfectNumber.java classes respectively.

now new VolumeOfFrustumOfCone method created and all test cases passed successfully of VolumeTest class

Author: Anurag

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

@@ -29,10 +29,10 @@ public String encode(String message, int shift) {
             char current = message.charAt(i); // Java law : char + int = char
 
             if (isCapitalLatinLetter(current)) {
-                current += shift;
+                current += (char) shift;
                 encoded.append((char) (current > 'Z' ? current - 26 : current)); // 26 = number of latin letters
             } else if (isSmallLatinLetter(current)) {
-                current += shift;
+                current += (char) shift;
                 encoded.append((char) (current > 'z' ? current - 26 : current)); // 26 = number of latin letters
             } else {
                 encoded.append(current);
@@ -56,10 +56,10 @@ public String decode(String encryptedMessage, int shift) {
         for (int i = 0; i < length; i++) {
             char current = encryptedMessage.charAt(i);
             if (isCapitalLatinLetter(current)) {
-                current -= shift;
+                current -= (char) shift;
                 decoded.append((char) (current < 'A' ? current + 26 : current)); // 26 = number of latin letters
             } else if (isSmallLatinLetter(current)) {
-                current -= shift;
+                current -= (char) shift;
                 decoded.append((char) (current < 'a' ? current + 26 : current)); // 26 = number of latin letters
             } else {
                 decoded.append(current);

src/main/java/com/thealgorithms/maths/AliquotSum.java

@@ -56,7 +56,7 @@ public static int getAliquotSum(int n) {
         // if n is a perfect square then its root was added twice in above loop, so subtracting root
         // from sum
         if (root == (int) root) {
-            sum -= root;
+            sum -= (int) root;
         }
         return sum;
     }

src/main/java/com/thealgorithms/maths/PerfectNumber.java

@@ -63,7 +63,7 @@ public static boolean isPerfectNumber2(int n) {
         // if n is a perfect square then its root was added twice in above loop, so subtracting root
         // from sum
         if (root == (int) root) {
-            sum -= root;
+            sum -= (int) root;
         }
 
         return sum == n;