feat: manual branch coverage: issue TheAlgorithms#3

Author: Gabrielstaifo

src/main/java/com/thealgorithms/strings/ValidParentheses.java

@@ -6,25 +6,43 @@
 //        Every close bracket has a corresponding open bracket of the same type.
 
 
+import java.util.*;
+
 public class ValidParentheses {
+	public static HashSet<String> branchesReached = new HashSet<>();
 	public static boolean isValid(String s) {
 		char[] stack = new char[s.length()];
 		int head = 0;
 		for(char c : s.toCharArray()) {
+			branchesReached.add("1.1");
 			switch(c) {
 				case '{':
+					branchesReached.add("1.2");
 				case '[':
+					branchesReached.add("1.3");
 				case '(':
 					stack[head++] = c;
 					break;
 				case '}':
-					if(head == 0 || stack[--head] != '{') return false;
+					branchesReached.add("1.4.1");
+					if(head == 0 || stack[--head] != '{') {
+						branchesReached.add("1.4.2");
+						return false;
+					}
 					break;
 				case ')':
-					if(head == 0 || stack[--head] != '(') return false;
+					branchesReached.add("1.5.1");
+					if(head == 0 || stack[--head] != '(') {
+						branchesReached.add("1.5.2");
+						return false;
+					}
 					break;
 				case ']':
-					if(head == 0 || stack[--head] != '[') return false;
+					branchesReached.add("1.6.1");
+					if(head == 0 || stack[--head] != '[') {
+						branchesReached.add("1.6.2");
+						return false;
+					}
 					break;
 			}
 		}

src/test/java/com/thealgorithms/strings/ValidParenthesesTest.java

@@ -1,5 +1,7 @@
 package com.thealgorithms.strings;
 
+import com.thealgorithms.datastructures.hashmap.hashing.HashMap;
+import org.junit.jupiter.api.AfterAll;
 import org.junit.jupiter.api.Test;
 import static org.junit.jupiter.api.Assertions.*;
 
@@ -20,5 +22,7 @@ void testTwo() {
     void testThree() {
         assertEquals(false, ValidParentheses.isValid("(]"));
     }
-	
+
+    @AfterAll
+    static void printCoverage(){System.out.println(ValidParentheses.branchesReached);}
 }