week 2 challenge

.classpath

@@ -1,6 +1,10 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <classpath>
-	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER">
+		<attributes>
+			<attribute name="module" value="true"/>
+		</attributes>
+	</classpathentry>
 	<classpathentry kind="src" path=""/>
 	<classpathentry kind="output" path=""/>
 </classpath>

fall23/Week11/.gitignore

@@ -0,0 +1 @@
+/App.class

fall23/Week11/App.java

@@ -1,3 +1,5 @@
+package fall23.Week11;
+
 import java.util.ArrayList;
 import java.util.Collections;
 import java.util.Scanner;

fall23/Week13/.gitignore

@@ -0,0 +1,4 @@
+/SNAFU$Input$SNAFUIterator.class
+/SNAFU$Input.class
+/SNAFU.class
+/SNAFUChallenge.class

fall23/Week13/SNAFU.java

@@ -1,3 +1,5 @@
+package fall23.Week13;
+
 import java.io.BufferedReader;
 import java.io.FileNotFoundException;
 import java.io.FileReader;

fall23/Week13/SNAFUChallenge.java

@@ -1,3 +1,5 @@
+package fall23.Week13;
+
 /**
  * Full Instructions and Explanation: https://adventofcode.com/2022/day/25
  * 

fall23/Week2/.gitignore

@@ -0,0 +1 @@
+/Week2.class

fall23/Week2/Week2.java

@@ -1,3 +1,5 @@
+package fall23.Week2;
+
 /**
  * Sum of Multiples of 3 or 5.
  *

fall23/Week4/.gitignore

@@ -0,0 +1,2 @@
+/Week4.class
+/Week4Bonus.class

fall23/Week4/Week4.java

@@ -1,3 +1,5 @@
+package fall23.Week4;
+
 /**
  * In this week's club bonus challenges, you will be tasked with solving problems relating to the Fibonacci Sequence.
  *

fall23/Week4/Week4Bonus.java

@@ -1,7 +1,9 @@
+package fall23.Week4;
+
 /**
  * In this week's club bonus challenge, you will be tasked with solving grid traversal problem.
  */
-public class Week4 {
+public class Week4Bonus {
 
     /**
      * In a 2x2 grid, there are exactly 6 routes from the top-left corner to the bottom-right corner.
@@ -21,6 +23,6 @@ public class Week4 {
     public static void main(String[] args) {
         long ans1 = problem1();
 
-        System.out.println(ans1 == 137846528820 ? "Problem 1 is correct!" : "Problem 1 (" + ans1 + ") is not correct...");
+        System.out.println(ans1 == 137846528820L ? "Problem 1 is correct!" : "Problem 1 (" + ans1 + ") is not correct...");
     }
 }

fall23/Week9/.gitignore

@@ -0,0 +1,8 @@
+/Task$SortByTitleComparator.class
+/Task.class
+/Week9.class
+/Week9Gui.class
+/Week9$1.class
+/Week9$2.class
+/Week9$3.class
+/Week9$4.class

fall23/Week9/Task.java

@@ -1,3 +1,4 @@
+package fall23.Week9;
 
 import java.util.Arrays;
 import java.util.Comparator;

fall23/Week9/Week9.java

@@ -1,3 +1,5 @@
+package fall23.Week9;
+
 import java.awt.event.ActionEvent;
 import java.awt.event.ActionListener;
 import java.io.BufferedReader;

fall23/Week9/Week9Gui.java

@@ -1,3 +1,5 @@
+package fall23.Week9;
+
 import java.util.ArrayList;
 
 import javax.swing.JFrame;

spring24/week2/.gitignore

@@ -0,0 +1,2 @@
+/Challenge.class
+/BonusChallenge.class

spring24/week2/Challenge.java

@@ -0,0 +1,59 @@
+package spring24.week2;
+
+/**
+ * 
+ * This weeks Coding Challenge is inspired by Leetcode problem 9.
+ * 
+ * A palindrome is defined as a String of characters which are the same forwards and backwards.
+ * 		eg. 123321
+ * 			asdfdsa
+ * 			kayak
+ * 
+ * BONUS CHALLENGE: 
+ * 
+ * Allow for two modes, a "palindrome generator" and a "palindrome checker". The generator prompts the user to enter in any sequence of characters, and converts it into a palindrome.
+ * The checker prompts the user to enter in any sequence of characters and then checks if it is a palindrome.
+ * 
+ */
+public class Challenge {
+	
+	/**
+	 * Determines if an input string is a palindrome.
+	 * 
+	 * @param input
+	 * @return
+	 */
+	public boolean isPalindrome(String input) {
+		return false; // TODO
+	}
+	
+	/**
+	 * Tests for isPalindrome method.
+	 * 
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		
+		Challenge c = new Challenge();
+		
+		// Test 123321
+		System.out.print("Palindrome 123321 answer is: ");
+		System.out.println(c.isPalindrome("123321") ? "correct!" : "incorrect!");
+	
+		// Test asdfdsa
+		System.out.print("Palindrome asdfdsa answer is: ");
+		System.out.println(c.isPalindrome("asdfdsa") ? "correct!" : "incorrect!");
+		
+		// Test kayak
+		System.out.print("Palindrome kayak answer is: ");
+		System.out.println(c.isPalindrome("kayak") ? "correct!" : "incorrect!");
+		
+		// Test java
+		System.out.print("Palindrome java answer is: ");
+		System.out.println(c.isPalindrome("java") ? "incorrect!" : "correct!");
+		
+		// Test 1969
+		System.out.print("Palindrome 1969 answer is: ");
+		System.out.println(c.isPalindrome("1969") ? "incorrect!" : "correct!");
+	}
+}