Coding tests are an essential part of modern software development. Especially in object-oriented languages like Java, it is crucial to develop algorithm problem-solving skills. In this course, we will address the algorithm problem titled ‘Finding Non-Perfect Squares’. This problem involves finding the remaining numbers in an integer array excluding the perfect squares.<\/p>\n
This problem requires identifying non-perfect square numbers from a given integer array. A perfect square is a number that results from squaring an integer, such as To solve this problem, we will follow these steps:<\/p>\n To determine if a number Now we will implement this algorithm in Java.<\/p>\n The above code iterates through the provided array using a method called Let’s run the code in practice. The From the input array 0, 1, 4, 9, 16, ...<\/code>.<\/p>\nInput<\/h3>\n
\n
Output<\/h3>\n
\n
Problem-Solving Strategy<\/h2>\n
\n
How to Check for Perfect Square<\/h3>\n
x<\/code> is a perfect square, you can first calculate the square root of x<\/code> and then convert that square root into an integer and square it again. If it matches x<\/code>, then x<\/code> is a perfect square.<\/p>\nboolean isPerfectSquare(int x) {\n if (x < 0) return false;\n int s = (int) Math.sqrt(x);\n return s * s == x;\n}<\/code><\/pre>\nJava Implementation<\/h2>\n
import java.util.ArrayList;\nimport java.util.List;\n\npublic class FindNonPerfectSquares {\n \n public static List<Integer> findNonPerfectSquares(int[] arr) {\n List<Integer> result = new ArrayList<>();\n\n for (int num : arr) {\n if (!isPerfectSquare(num)) {\n result.add(num);\n }\n }\n \n return result;\n }\n \n private static boolean isPerfectSquare(int x) {\n if (x < 0) return false;\n int s = (int) Math.sqrt(x);\n return s * s == x;\n }\n\n public static void main(String[] args) {\n int[] inputArray = {1, 2, 3, 4, 5, 9, 10, 15, 16, 20};\n List<Integer> nonPerfectSquares = findNonPerfectSquares(inputArray);\n System.out.println(\"Non-perfect squares: \" + nonPerfectSquares);\n }\n}<\/code><\/pre>\nCode Explanation<\/h2>\n
findNonPerfectSquares<\/code>. For each number, it calls the isPerfectSquare<\/code> method to skip perfect squares and adds only non-perfect squares to the result list.<\/p>\nTesting<\/h3>\n
main<\/code> method defines a test input array, calls the function, and outputs the list of non-perfect squares.<\/p>\nResult Analysis<\/h2>\n
{1, 2, 3, 4, 5, 9, 10, 15, 16, 20}<\/code>, the non-perfect squares are {2, 3, 5, 10, 15, 20}<\/code>. This is an important step to verify the accuracy of the algorithm.<\/p>\nComplexity Analysis<\/h2>\n