update comment for 1641

fishercoder1534 · fishercoder1534 · commit 5a438cfb1212 · 2022-05-11T06:59:33.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1641.java b/src/main/java/com/fishercoder/solutions/_1641.java
@@ -8,7 +8,7 @@ public static class Solution1 {
          * I solved this problem using Math, no DP, recursion or backtracking techniques.
          * Time: beat 100% submission consistently since it's O(n), essentialy it's O(1) because the contraints in the problem state: 1 <= n <= 50
          * After writing out from n = 1 to 3, we can see the pattern.
-         * Detailed reasoning to be seen in my youtube video on my channel: https://www.youtube.com/fishercoder.
+         * Detailed reasoning to be seen in my YouTube video on my channel: https://youtu.be/gdH4yfgfwiU
          */
         public int countVowelStrings(int n) {
             if (n == 1) {
