diff --git a/src/test/java/com/thealgorithms/datastructures/graphs/TwoSatTest.java b/src/test/java/com/thealgorithms/datastructures/graphs/TwoSatTest.java
index 15e77b357..76b5aa8a7 100644
--- a/src/test/java/com/thealgorithms/datastructures/graphs/TwoSatTest.java
+++ b/src/test/java/com/thealgorithms/datastructures/graphs/TwoSatTest.java
@@ -8,7 +8,7 @@ import org.junit.jupiter.api.Test;
 
 /**
  * Testcases for 2-SAT.
- * Please note thea whlie checking for boolean assignments always keep n + 1 elements and the first element should be always false.
+ * Please note thea while checking for boolean assignments always keep n + 1 elements and the first element should be always false.
  */
 public class TwoSatTest {
     private TwoSat twoSat;
diff --git a/src/test/java/com/thealgorithms/datastructures/lists/SinglyLinkedListTest.java b/src/test/java/com/thealgorithms/datastructures/lists/SinglyLinkedListTest.java
index f80c6b505..fde52b982 100644
--- a/src/test/java/com/thealgorithms/datastructures/lists/SinglyLinkedListTest.java
+++ b/src/test/java/com/thealgorithms/datastructures/lists/SinglyLinkedListTest.java
@@ -214,10 +214,10 @@ public class SinglyLinkedListTest {
 
     @Test
     void readWithEnhancedForLoopTest() {
-        final var expeced = new ArrayList<Integer>(Arrays.asList(10, 20, 30));
+        final var expected = new ArrayList<Integer>(Arrays.asList(10, 20, 30));
 
         SinglyLinkedList list = new SinglyLinkedList();
-        for (final var x : expeced) {
+        for (final var x : expected) {
             list.insert(x);
         }
 
@@ -226,7 +226,7 @@ public class SinglyLinkedListTest {
             readElements.add(x);
         }
 
-        assertEquals(readElements, expeced);
+        assertEquals(readElements, expected);
     }
 
     @Test