Challenge: Anagram Problem
Explore how to create a Java function that determines if two strings are anagrams by comparing their letter arrangements case-insensitively. Understand how to implement and test this logic, and learn to use methods for clear, reusable code in practical programming challenges.
Task
Write a function that accepts two strings as parameters and checks whether these strings are anagrams of each other. An anagram is a text formed by rearranging the letters of another piece of text.
The strings should not be case-sensitive, meaning that Cats and AcTs are anagrams.
The function should return 1 when the strings are anagrams and -1 otherwise.