WRITTEN IN JAVA

CAN PROVIDE TEST CASES IF NEEDED

This problem is similar to SneakyQueens, but the solution requires a bit of a twist that will push you to employ your knowledge of data structures in clever ways. It has more restrictive runtime and space complexity requirements, as well: Your program needs to have an average-case / expected runtime complexity that does not exceed O(n) (where n is the number of knights), and a worst-case space complexity that does not exceed O(n) The assignment also has a different board size restriction: The maximum board size is now Integer. MAX-VALUE Integer. MAX-VALUE. Please feel free to seek out help in office hours if you're lost, and remember that it's okay to have conceptual discussions with other students about this problem, as long as you're not sharing code (or pseudocode, which is practically the same thing). Just keep in mind that you'll benefit more from this problem if you struggle with it a bit before discussing it with anyone else. SneakyKnights.java