jdk

.github/workflows/interview_prep.yml

@@ -10,7 +10,7 @@ jobs:
     runs-on: ubuntu-latest
     steps:
       - name: Checkout code
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
       - name: Setup Rust toolchain
         uses: actions-rs/toolchain@v1
         with:
@@ -26,7 +26,7 @@ jobs:
     runs-on: ubuntu-latest
     steps:
       - name: Checkout code
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
       - name: Set up Python 3.x
         uses: actions/setup-python@v2
         with:
@@ -41,13 +41,13 @@ jobs:
     runs-on: ubuntu-latest
     steps:
       - name: Checkout code
-        uses: actions/checkout@v2
-      - name: Set up JDK 17
-        uses: actions/setup-java@v2
+        uses: actions/checkout@v3
+      - name: Set up JDK 21
+        uses: actions/setup-java@v3
         with:
-          java-version: 17
-          distribution: 'adopt'
+          java-version: 21
+          distribution: 'corretto'
       - name: Build and test Java
         run: |
-          cd interview_prep/algorithm/java17
+          cd interview_prep/algorithm/java
           ./mvnw test

interview_prep/algorithm/java/.vscode/settings.json

@@ -0,0 +1,3 @@
+{
+    "java.debug.settings.onBuildFailureProceed": true
+}

interview_prep/algorithm/java17/pom.xml → interview_prep/algorithm/java/pom.xml

@@ -14,8 +14,8 @@
 
   <properties>
     <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
-    <maven.compiler.source>17</maven.compiler.source>
-    <maven.compiler.target>17</maven.compiler.target>
+    <maven.compiler.source>21</maven.compiler.source>
+    <maven.compiler.target>21</maven.compiler.target>
   </properties>
 
   <dependencyManagement>

interview_prep/algorithm/java17/src/main/java/hoa/can/code/classic/graph/Search.java → interview_prep/algorithm/java/src/main/java/hoa/can/code/classic/graph/Search.java

@@ -126,11 +126,13 @@ public static <T> Node<T> bfs(
         while (!frontier.isEmpty()) {
             Node<T> currentNode = frontier.poll();
             T currentState = currentNode.state;
+            System.out.println("currentState: "+currentState);
             if (goalTest.test(currentState)) {
                 return currentNode;
             }
             // check where we can go next and haven't explored
             for (T child : successors.apply(currentState)) {
+                System.out.println("child " +child+", visited:" + explored);
                 if (explored.contains(child)) {
                     continue; // skip children we already explored
                 }

interview_prep/algorithm/java17/src/test/java/hoa/can/code/UndirectedGraphTest.java → interview_prep/algorithm/java/src/test/java/hoa/can/code/UndirectedGraphTest.java

@@ -8,6 +8,7 @@
 import java.util.List;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
 
 public class UndirectedGraphTest {
     @Test
@@ -18,9 +19,8 @@ public void test1() {
                 "Seattle",
                 v -> v.equals("Chicago"),
                 g::neighbor);
-        List<String> path = Search.nodeToPath(bfsResult);
-        assertEquals(List.of("Seattle","Chicago"), path);
-
+        assertNotNull(bfsResult);
+        assertEquals(List.of("Seattle","Chicago"), Search.nodeToPath(bfsResult));
     }
 
     @Test
@@ -31,6 +31,7 @@ public void test2() {
                 "Seattle",
                 v -> v.equals("Riverside"),
                 g::neighbor);
+        assertNotNull(bfsResult);
         List<String> path = Search.nodeToPath(bfsResult);
         assertEquals("Seattle", path.get(0));
         assertEquals("Riverside", path.get(path.size()-1));
@@ -45,9 +46,8 @@ public void test3() {
                 "Chicago",
                 v -> v.equals("Seattle"),
                 g::neighbor);
-        List<String> path = Search.nodeToPath(bfsResult);
-        assertEquals(List.of("Chicago","Seattle"), path);
-
+        assertNotNull(bfsResult);
+        assertEquals(List.of("Chicago","Seattle"), Search.nodeToPath(bfsResult));
     }
 
     @Test
@@ -59,7 +59,11 @@ public void test4() {
                 "Boston",
                 v -> v.equals("Miami"),
                 g::neighbor);
+
+        assertNotNull(bfsResult);
         List<String> path = Search.nodeToPath(bfsResult);
+        assertEquals("Seattle", path.get(0));
+        assertEquals("Riverside", path.get(path.size()-1));
     }
 
     private UndirectedGraph<String> cities(){