corrected

Author: SadafKausar2025

dsa-solutions/lc-solutions/0200-0299/0206-Reverse-Linkedlist.md

@@ -296,4 +296,9 @@ The problem is asking to reverse a singly-linked list. One common approach to re
 
 ## Video lecture
 
-<iframe width="560" height="315" src="https://www.youtube.com/embed/D2vI2DNJGd8?si=fCV_x4Mwv--u4yUb" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" referrerpolicy="strict-origin-when-cross-origin" allowfullscreen></iframe>
+<LiteYouTubeEmbed
+    id="D2vI2DNJGd8"
+    params="autoplay=1&autohide=1&showinfo=0&rel=0"
+    title="CodeHarborHub Reverse Linkedlist"
+    poster="maxresdefault"
+    webp />

dsa-solutions/lc-solutions/0200-0299/0208-Implement-Trie.md

@@ -11,8 +11,6 @@ tags:
 description: "This document provides a solution to the Implementation of Trie."
 ---
 
-# 0208- Implement Trie (Prefix Tree)
-
 ## Problem Statement
 
 A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.
@@ -300,4 +298,9 @@ Explanation
 
 ## Video Lecture:
 
-<iframe width="560" height="315" src="https://www.youtube.com/embed/YXefcFMpemo?si=OKoeQHKTtnsy1yby" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" referrerpolicy="strict-origin-when-cross-origin" allowfullscreen></iframe>
+<LiteYouTubeEmbed
+    id="YXefcFMpemo"
+    params="autoplay=1&autohide=1&showinfo=0&rel=0"
+    title="CodeHarborHub Implement Trie Video"
+    poster="maxresdefault"
+    webp />