Update schedule.md

Author: jdchoi77

docs/schedule.md

@@ -29,7 +29,7 @@
 |11/11| [Homework 2](https://emory.zoom.us/rec/share/1FzBXB8581_8fTwXZz1lCLGPquaFgE13i9TWY-f8u2wpifBzTtq4m31qAyKwTd0m.khjxck1oQ5s4K23R) | | [hw 3](https://canvas.emory.edu/courses/76034/assignments/408681) | 
 |11/16| [Network Flow](https://emory.zoom.us/rec/share/AyviVMlLixWFDeJzUC_wb__x0AvIhJN8GFlD1u_ffst-V9fIGYvqQnZgSZlJD-jB.84wsBJ68HPBVxogb) |  | [quiz 8](https://canvas.emory.edu/courses/76034/assignments/410195) |
 |11/18| [Dynamic Programming](https://emory.zoom.us/rec/share/P1k3sxxd-2GSF26EQmPjVoCU6xZ_FOOZ-yQ92yJLZASLqKxVU_0yK8lZyqEN2oCV.tzbLlckOfJrrRAyH) | [book](https://emory.gitbook.io/dsa-java/dynamic-programming), [main](../src/main/java/edu/emory/cs/dynamic), [test](../src/test/java/edu/emory/cs/dynamic) | |
-|11/23| [Dynamic Programming](https://emory.zoom.us/rec/share/bcmHGe3DHQA-VEAzgfmv74SZsiv-NFsPVFJgxneu8akX4dufQwVdN4JxX2PFgF_z.WEJrZfqhrE3OiiAM) | | [quiz 9]() |
+|11/23| [Dynamic Programming](https://emory.zoom.us/rec/share/bcmHGe3DHQA-VEAzgfmv74SZsiv-NFsPVFJgxneu8akX4dufQwVdN4JxX2PFgF_z.WEJrZfqhrE3OiiAM) | | [quiz 9](https://canvas.emory.edu/courses/76034/assignments/414548) |
 
 <!--  -->
 <!-- [Shortest Path Algorithms]() | [md](), [pdf](shortest_path_algorithms.pdf), [main](../src/main/java/edu/emory/cs/graph/path/) | [quiz 8](quiz0.md#quiz-8) | -->

src/main/java/edu/emory/cs/dynamic/lcs/LCSQuiz.java

@@ -16,8 +16,8 @@
 package edu.emory.cs.dynamic.lcs;
 
 
-import java.util.ArrayList;
-import java.util.List;
+import java.util.Set;
+import java.util.TreeSet;
 
 /**
  * @author Jinho D. Choi ({@code jinho.choi@emory.edu})
@@ -26,11 +26,11 @@ public class LCSQuiz extends LCSDynamic {
     /**
      * @param a the first string.
      * @param b the second string.
-     * @return a list of all longest common sequences between the two strings.
+     * @return a set of all longest common sequences between the two strings.
      */
-    public List<String> solveAll(String a, String b) {
+    public Set<String> solveAll(String a, String b) {
         // TODO: to be filled
-        return new ArrayList<>();
+        return null;
     }
 }